234. 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?

分析：
反转链表法，将链表后半段原地翻转，再将前半段、后半段依次比较，判断是否相等，时间复杂度O（n），空间复杂度为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 *fast = head, *slow = head;
    while (fast && fast->next) {
        slow = slow->next;
        fast = fast->next->next;
    }

    if (fast) {    // 奇数个
        slow->next = reverse(slow->next);
        slow = slow->next;
    }
    else
        slow = reverse(slow);

    ListNode *cur = head;
    while (slow) {
        if (cur->val != slow->val)
            return false;
        cur = cur->next;
        slow = slow->next;
    }
    return true;
}

ListNode *reverse(ListNode *head) {
    if (head == NULL || head->next == NULL)
        return head;

    ListNode *prev = head;
    for (ListNode *cur = head->next, *next = cur->next; cur;
            prev = cur, cur = next, next = next ? next->next : NULL) 
        cur->next = prev;
    head->next = NULL;
    return prev;
}

};