回文 水题
function ListNode(val) {
this.val = val;
this.next = null;
}
/**
* @param {ListNode} head
* @return {boolean}
*/
var isPalindrome = function(head) {
var list = [];
while (head) {
list.push(head.val);
head = head.next;
}
for (let i = 0; i < (list.length + 1) / 2; i++) {
if (list[i] !== list[list.length - i - 1]) {
return false;
}
}
return true;
};
原题 回文 水题
这题的进阶要求是O(n)的时间复杂度和O(1)的空间复杂度，意味着包括栈和字符串在内的所有开辟数组的解决方案都不可...
问题： Given a singly linked list, determine if it is a pali...
234. 回文链表[https://leetcode.cn/problems/palindrome-linked-...
234. 回文链表[https://leetcode-cn.com/problems/palindrome-lin...
234. 回文链表[https://leetcode-cn.com/problems/palindrome-lin...
234. 回文链表[https://leetcode-cn.com/problems/palindrome-lin...
题目234. Palindrome Linked List Given a singly linked list,...
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
题目 Given a singly linked list, determine if it is a palin...
本文标题：[LeetCode] 234. Palindrome Linke
本文链接：https://www.haomeiwen.com/subject/xyiqxqtx.html
网友评论