Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- * 机智的秋秋秋
- * 「解题思路」把原list给reverse一下比一比不就知道了嘛「我这算是在作弊吧喂
- * 「时间复杂度」O(n)?
- * 「空间复杂度」你猜
- * 「其他」我觉得linkedlist给的method太业界良心了ˊ_>ˋ
- */
- import java.util.LinkedList;
- import java.util.Random;
- public class IsParadrome {
- public static void main(String[] args){
- LinkedList<Integer> list = new LinkedList<Integer>();
- Random r = new Random();
- list.add(1);
- list.add(2);
- list.add(1);
- System.out.println(list.toString());
- System.out.println(isParadrome(list));
- }
- private static boolean isParadrome(LinkedList<Integer> list) {
- LinkedList<Integer> origin = (LinkedList<Integer>) list.clone();
- java.util.Collections.reverse(list);
- if(origin.equals(list)){
- return true;
- }else{
- return false;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement