LeetCode0234-是否为回文联表

判断链表是否为回文链表

public class Num234_palindromeLinkedList {
    //方法一：判断是否为环形链表
    public boolean isPalindrome(ListNode head) {

        ArrayList<Integer> a = new ArrayList<Integer>();
        while(head!=null){
            a.add(head.val);
            head= head.next;
        }

        for(int i =0;i<a.size();i++){
            int j = a.size()-i-1;
            if(a.get(i)!=a.get(j)){return false;}
        }
        return true;
    }
    }