题目
给你一个单链表的头节点 head ,请你判断该链表是否为回文链表。如果是,返回 true ;否则,返回 false 。
示例 1:
输入:head = [1,2,2,1]
输出:true
示例 2:
输入:head = [1,2]
输出:false
题解一 数组
var isPalindrome = function(head) {
const vals = [];
while (head !== null) {
vals.push(head.val);
head = head.next;
}
for (let i = 0, j = vals.length - 1; i < j; ++i, --j) {//循环条件
if (vals[i] !== vals[j]) {
return false;
}
}
return true;
};
笔记:
- 将链表的值压入数组,循环计算
题解二 反转
var reverseList = function (head) {
if (head == null || head.next == null) {
return head;
}
let cur = reverseList(head.next);//传入head的next
head.next.next = head;
head.next = null;
return cur;
};
/**
* @param {ListNode} head
* @return {boolean}
*/
var isPalindrome = function (head) {
// 如果是空链表或者是只有一个节点的链表 则自然是回文链表
if (!head || !head.next) {
return true;
}
let fast = head,
slow = head;
while (fast && fast.next) {
slow = slow.next;
fast = fast.next.next;
}
// 如果是奇数情况下,保证slow指向的是后半段起始节点
if (fast != null) {
slow = slow.next;
}
let left = head,
right = reverseList(slow);
while (right) {
if (left.val != right.val) {
return false;
}
left = left.next;
right = right.next;
}
return true;
};
笔记:
- 反转后半部分链表 进行对比