题解 | #进制转换#

public boolean isPail (ListNode head) {
//1.先把listnode中的val放到数组中
ListNode cur = head;
int n = 0;
while(cur!=null){
n++;
cur = cur.next;
}

    cur = head;
    int[] arr = new int[n];
    for(int i=0;i<n;i++){
        arr[i] = cur.val;
        cur = cur.next;
    }

    //2.对数组进行回文判断
    boolean flag = true;
    for(int i=0;i<n/2;i++){
        if(arr[i] != arr[n-1-i]){
            flag = false;
            break;
        }
    }

    return flag;
}