Problem: 234. 回文链表
思路 & 解题方法
先转成列表。
复杂度
时间复杂度:
添加时间复杂度, 示例: O ( n ) O(n) O(n)
空间复杂度:
添加空间复杂度, 示例: O ( n ) O(n) O(n)
Code
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def isPalindrome(self, head: Optional[ListNode]) -> bool:
l = []
while head:
l.append(head.val)
head = head.next
left, right = 0, len(l) - 1
while left <= right:
if l[left] != l[right]:
return False
left += 1
right -= 1
return True