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

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */

/**
 *
 * @param head ListNode类 the head
 * @return bool布尔型
 */
function isPail(head) {
    // write code here
    let arr = [];
    while (head) {
        arr.push(head.val);
        head = head.next;
    }

    return is(arr);
}

function is(arr) {
    let left = 0,
        right = arr.length - 1;
    while (left <= right) {
        if (arr[left++] != arr[right--]) return false;
    }
    return true;
}
module.exports = {
    isPail: isPail,
};