题解 | #判断一个链表是否为回文结构#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 the head
     * @return bool布尔型
     */
    public boolean isPail (ListNode head) {
        // write code here
         if(head==null){
            return false;
         }
         if(head.next == null){
            return true;
         }
         List<Integer> list = new ArrayList<>();
         ListNode cur = head;
         while(cur!=null){
            list.add(cur.val);
            cur = cur.next;
         }
         for(int i = 0; i < list.size(); i++){
            System.out.println(list.get(i));
            System.out.println(list.get(list.size()-1-i));
            if(list.get(i)-list.get(list.size()-1-i)!=0){
                
                return false;
            }
         }
         return true;
    }
}