题目要求:
分析:
这道题目要求用O(1)的复杂度来做,那么我们就应该想到将这个链表从中间拆分开来进行比较。具体想法是这样的:
- 用快慢指针法找到这个链表的中点,记为middle;
- 取后半个链表,进行反转,反转链表之前做过;
- 将反转后的链表与前半个链表进行比较,如果相等,则返回true,如果不相等,则返回false。
具体代码如下:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isPalindrome(ListNode head) {
if (head == null || head.next == null) {
return true;
}
ListNode middle = partition(head);
middle = reverseList(middle);
while (head != null && middle != null) {
if (head.val!=middle.val) {
return false;
}
head = head.next;
middle=middle.next;
}
return true;
}
// 快慢指针查找中点
private ListNode partition(ListNode head) {
ListNode fast = head, slow = head;
while(fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
}
return slow;
}
// 反转后半个链表
public ListNode reverseList(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode temp = new ListNode(0);
ListNode curr = head;
ListNode prev = null;
while(curr != null) {
temp = curr.next;
curr.next = prev;
prev = curr;
curr = temp;
}
return prev;
}
}