234.回文链表
题目描述
Leetcode:https://leetcode-cn.com/problems/palindrome-linked-list/
请判断一个链表是否为回文链表。
示例 1:
输入: 1->2
输出: false
示例 2:
输入: 1->2->2->1
输出: true
进阶:
你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题?
解题思路
切成两半,把后半段反转,比较两段是否相等
java代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isPalindrome(ListNode head) {
if(head == null || head.next == null) return true;
ListNode slow = head, fast = head.next;
while(fast != null && fast.next != null){
slow = slow.next;
fast = fast.next.next;
}
if(fast != null) slow = slow.next; //偶数节点,让slow指向下一节点
cut(head, slow); //切成两个链表
return isEqual(head, revese(slow));
}
private void cut(ListNode head, ListNode cutNode){
while(head.next != cutNode){
head = head.next;
}
head.next = null;
}
private ListNode revese(ListNode head){
ListNode newHead = null;
while(head != null){
ListNode nextNode = head.next;
head.next = newHead;
newHead = head;
head = nextNode;
}
return newHead;
}
private boolean isEqual(ListNode l1, ListNode l2){
while(l1 != null && l2 != null){
if(l1.val != l2.val) return false;
l1 = l1.next;
l2 = l2.next;
}
return true;
}
}
python代码
# 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 head == None or head.next == None:
return True
slow = head
fast = head.next
while fast and fast.next:
slow = slow.next
fast = fast.next.next
if fast:
slow = slow.next
newHead = self.reverse(slow)
while head and newHead:
if head.val != newHead.val:
return False
head = head.next
newHead = newHead.next
return True
def reverse(self, head: ListNode) -> ListNode:
newHead = None
while head:
nodeNext = head.next
head.next = newHead
newHead = head
head = nodeNext
return newHead