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

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param head ListNode类 the head
 * @return bool布尔型
 */
function isPail(head) {
    // write code here
    if (head == null || head.next == null) {
        return true;
    }
    let arr1 = [];
    let cur = head;
    while (cur) {
        arr1.push(cur.val);
        cur = cur.next;
    }
    let left = 0,
        right = arr1.length - 1;
    while (left < right) {
        if (arr1[left] !== arr1[right]) {
            return false;
        }
        left++;
        right--;
    }
    return true;
}
module.exports = {
    isPail: isPail,
};