LeetCode - Palindrome Linked List

Palindrome Linked List

  Total Accepted: 4904  Total Submissions: 20945 My Submissions

Question  Solution 

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?

先找到中点，然后把后半部分反转，再比较

class Solution {
public:
    bool isPalindrome(ListNode* head) {
        if(!head) return true;
        ListNode* dummy = new ListNode(0);
        dummy->next = head;
        ListNode* fast = dummy, *slow = dummy;
        while(fast && fast->next){
            fast = fast->next->next;
            slow = slow->next;
        }
        slow->next = reverse(slow->next);
        ListNode *p1 = slow->next;
        ListNode *p2 = head;
        while(p1){
            if(p1->val != p2->val) return false;
            p1 = p1->next;
            p2 = p2->next;
        }
        return true;
    }
    
    ListNode* reverse(ListNode* head){
        if(!head) return nullptr;
        ListNode* prev = nullptr;
        ListNode* curr = head;
        ListNode* next;
        while(curr){
            next = curr->next;
            curr->next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
};