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

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param head ListNode类 the head
 * @return bool布尔型
 */
function isPail(head) {
    if (head == null) {
        return false;
    }
    let p = head;
    let stack = [];
    while (p) {
        stack.push(p.val);
        p = p.next;
    }

    let count = stack.length;
    for (let i = 0; i <= count / 2; i++) {
        if (stack[i] !== stack[count - i - 1]) {
            return false;
        }
    }
    return true;
}
module.exports = {
    isPail: isPail,
};