题目:
Given a singly linked list, determine if it is a palindrome.
Follow up:
Could you do it in O(n) time and O(1) space?
思路:
如果不限制O(1)的时间复杂度,那么方法就非常多了。既然限制了空间复杂度,那么可以有如下几个步骤来实现:1)用快慢指针同时走,来确定链表的中点;2)就地逆转中点之后的链表;3)判断前半段和后半段是否相等;4)恢复后半部分的链表原貌(可选)。上面四个步骤的每一个步骤的时间复杂度都是O(n),所以总的时间复杂度也是O(n)。
代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool isPalindrome(ListNode* head) {
if (head == NULL || head->next == NULL) {
return true;
}
ListNode *slow = head, *fast = head;
while (fast->next && fast->next->next) { // find the middle node
slow = slow->next;
fast = fast->next->next;
}
ListNode *p = slow->next, *q = head;
while (p->next) { // reverse the second half
ListNode *temp = p->next;
p->next = temp->next;
temp->next = slow->next;
slow->next = temp;
}
while (slow->next) { // compare
slow = slow->next;
if (slow->val != q->val) {
return false;
}
q = q->next;
}
return true;
}
};