Leetcode: Palindrome Linked List



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?

几个知识点的综合：

1. 快慢指针找中点

2. 链表反转

3. 回文

/**
 * 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) {
        // find the middle
        ListNode* fast = head;
        ListNode* slow = head;
        while (fast != nullptr && fast->next != nullptr) {
            fast = fast->next->next;
            slow = slow->next;
        }
        
        // reverse the list
        ListNode* middle = slow;
        ListNode* prev = nullptr;
        ListNode* tmp = nullptr;
        while (head != middle) {
            tmp = head->next;
            head->next = prev;
            prev = head;
            head = tmp;
        }
        
        // odd number of nodes
        if (fast != nullptr) {
            middle = middle->next;
        }
        
        while (middle != nullptr && prev != nullptr) {
            if (middle->val != prev->val) {
                return false;
            }
            
            middle = middle->next;
            prev = prev->next;
        }
        
        if (middle == nullptr && prev == nullptr) {
            return true;
        }
        
        return false;
    }
};