该题和以下这篇文章的进阶:
LeetCode206 && 剑指Offer 24:反转链表
目录
一、题目
请判断一个链表是否为回文链表。
二、示例
示例 1:
输入: 1->2
输出: false
示例 2:
输入: 1->2->2->1
输出: true
进阶:
- 你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题?
三、思路
1、暴力法:从头遍历链表,并将里面的val值存入数组res中,最后判断该数组是否是回文。
2、进阶:快慢指针法,具体做法:
- 第一步,快慢指针,找到后半段
- 第二步,反转后半段的链表。定义一个函数将其反转。
关于函数的定义,可看文章LeetCode206 && 剑指Offer 24:反转链表
- 第三步,判断前半段和后半段是否相等
四、代码
1、
# Definition for singly-linked list.
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def isPalindrome(self, head: ListNode) -> bool:
n = 0
p = head
res = []
while p:
n += 1
res.append(p.val)
p = p.next
return res == res[::-1]
if __name__ == '__main__':
head = ListNode(1)
head.next = ListNode(2)
head.next.next = ListNode(2)
head.next.next.next = ListNode(1)
s = Solution()
ans = s.isPalindrome(head)
print(ans)
2、
# Definition for singly-linked list.
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def isPalindrome(self, head: ListNode) -> bool:
if not head:
return True
slow, fast = head, head
while fast.next and fast.next.next:
slow = slow.next
fast = fast.next.next
print(slow.val)
def reverseList(head):
if not head:
return None
pre, cur = head, None
while pre:
t = pre.next
pre.next = cur
cur = pre
pre = t
return cur
mid = slow.next
slow.next = reverseList(mid)
while head and slow.next:
if head.val == slow.next.val:
head = head.next
slow = slow.next
else:
return False
return True
if __name__ == '__main__':
head = ListNode(1)
head.next = ListNode(2)
head.next.next = ListNode(2)
head.next.next.next = ListNode(1)
s = Solution()
ans = s.isPalindrome(head)
print(ans)