234.回文链表

·题目描述

给你一个单链表的头节点 head ，请你判断该链表是否为
回文链表
。如果是，返回 true ；否则，返回 false 。

 

示例 1：


输入：head = [1,2,2,1]
输出：true
示例 2：


输入：head = [1,2]
输出：false

·解题思路

1.将链表的数值进行记录

2.转数组，若是保持不变就是回文链表

·代码

# 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: ListNode) -> bool:
        num = []
        cur = head
        while cur :
            num.append(cur.val)
            cur = cur.next
        n = len(num)
        renum = []
        for i in range(len(num)-1, -1 , -1):
            renum.append(num[i])

        if renum == num :
            return True
        else:
            return False

_____________代码改进_____________

1.利用快慢指针找到链表的中间点

2.利用中间点将后部分链表进行翻转

3.对比原始链表的全部分和后部分是否数值一致，若均一致那么就是回文链表。否则不是

# 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: ListNode) -> bool:

            if head is None or head.next is None:
                return True

            ##利用快慢指针寻找到中点的位置
            slow , fast = head ,head
            while fast.next and fast.next.next:
                slow = slow.next
                fast = fast.next.next
           

            ##翻转列表的后部分
            pre , cur = None, slow.next
            while cur:
                post = cur.next
                cur.next = pre
                pre = cur
                cur = post
  
            ##判断是否相等
            right = pre
            left = head
            while right:
                if left.val != right.val:
                    return False
                left = left.next
                right = right.next
            return True