LeetCode OJ 之 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?

思路：

前半段逆序，然后和后半段比较

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode * reverseList(ListNode *head)
    {
        if(head == NULL || head->next == NULL)
            return head;
        ListNode *p1 = head , *p2 = head->next , *p3 = p2;
        p1->next = NULL;
        while(p2)
        {
            p3 = p2->next;
            p2->next = p1;
            p1 = p2;
            p2 = p3;
        }
        return p1;
    }
    bool isPalindrome(ListNode* head) 
    {
        if(head == NULL || head->next == NULL)
            return true;
         ListNode *p1  = head, *p2 = head , *tmp;
         while(p2 && p2->next)
         {
             tmp = p1;
             p1 = p1->next;
             p2 = p2->next->next;
         }
         if(p2)
         {
             p2 = p1->next;//奇数个结点，p2为中间结点的后一个
         }
         else
         {
             p2 = p1;//偶数个结点，p2为后半段的第一个结点
         }
         p1 = head;
         tmp->next = NULL;//把前半段链表断开
         p1 = reverseList(p1);
         while(p1 && p2)
         {
             if(p1->val != p2->val)
                return false;
            p1 = p1->next;
            p2 = p2->next;
         }
         return true;
    }
};