day11 回文链表(leetcode)

回文链表

题目：

编写一个函数，检查输入的链表是否是回文的。

解题：

1. 用列表直接存储
2. 快慢指针找到链表的中间节点，然后反转链表进行判断，最后再讲链表还原

代码：

法一

class Solution:
    def isPalindrome(self, head: ListNode) -> bool:
        lst, cur = [], head
        while cur:
            lst.append(cur.val)
            cur = cur.next
        return lst == lst[::-1]

法二

class Solution:
    def isPalindrome(self, head: ListNode) -> bool:
        if head is None:
            return True

        # 找到前半部分链表的尾节点并反转后半部分链表
        first_half_end = self.end_of_first_half(head)
        second_half_start = self.reverse_list(first_half_end.next)

        # 判断是否回文
        result = True
        first_position = head
        second_position = second_half_start
        while result and second_position is not None:
            if first_position.val != second_position.val:
                result = False
            first_position = first_position.next
            second_position = second_position.next

        # 还原链表并返回结果
        first_half_end.next = self.reverse_list(second_half_start)
        return result    

    def end_of_first_half(self, head):
        fast = head
        slow = head
        while fast.next is not None and fast.next.next is not None:
            fast = fast.next.next
            slow = slow.next
        return slow

    def reverse_list(self, head):
        previous = None
        current = head
        while current is not None:
            next_node = current.next
            current.next = previous
            previous = current
            current = next_node
        return previous