public boolean isPail (ListNode head) {

    ListNode node = head;

    LinkedList<Integer> list = new LinkedList<>();

    while (node != null) {

        list.addLast(node.val);

        node = node.next;

    }

    while (list.size()>1) {

        if (!list.removeFirst().equals(list.removeLast())) {

            return false;

        }

    }

    return true;

}

public class Solution {

    /**

     *

     * @param head ListNode类 the head

     * @return bool布尔型

     */

    public boolean isPail (ListNode head) {

        // 将链表元素放到数组

        ArrayList<Integer> arr = new ArrayList<Integer>();

        ListNode cur = head;

        while(cur!=null){

            arr.add(cur.val);

            cur = cur.next;

        }

        // 数组双指针判断回文

        int i=0;

        int j=arr.size()-1;

        while(i<=j){

                if((arr.get(i)).equals(arr.get(j))){

                    i++;

                    j--;

                }else{

                    return false;

                }

        }

        return true;

    }

}