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?
这个题目在discussion里有人证明了空间复杂度不可能为O(1)。
/**
* 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* prev = NULL;
ListNode* slow = head;
ListNode* fast = head;
while (fast != NULL && fast->next != NULL) {
prev = slow;
slow = slow->next;
fast = fast->next->next;
}
prev->next = NULL;
ListNode* node = reverse(slow);
while(node != NULL && head != NULL) {
if (node->val != head->val) {
return false;
}
node = node->next;
head = head->next;
}
return true;
}
private:
ListNode *reverse(ListNode* node) {
if (node == NULL) {
return node;
}
ListNode* prev = NULL;
while(node != NULL) {
ListNode* tmp = node->next;
node->next = prev;
prev = node;
node = tmp;
}
return prev;
}
};
* 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* prev = NULL;
ListNode* slow = head;
ListNode* fast = head;
while (fast != NULL && fast->next != NULL) {
prev = slow;
slow = slow->next;
fast = fast->next->next;
}
prev->next = NULL;
ListNode* node = reverse(slow);
while(node != NULL && head != NULL) {
if (node->val != head->val) {
return false;
}
node = node->next;
head = head->next;
}
return true;
}
private:
ListNode *reverse(ListNode* node) {
if (node == NULL) {
return node;
}
ListNode* prev = NULL;
while(node != NULL) {
ListNode* tmp = node->next;
node->next = prev;
prev = node;
node = tmp;
}
return prev;
}
};