LeetCode || Palindrome Linked List

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?

算法时间：  28ms。

/**
 * 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* p1 = head, *p2 = head;
        //p1表示当前链表的正中位置
        while(p1 != NULL && p2 != NULL && p2->next != NULL && p2->next->next!= NULL)
        {
            p1 = p1->next;
            p2 = p2->next;
            p2 = p2->next;
        }
          
        //reverse 将链表的后半段进行reverse
        ListNode* pre = p1;
        p2 = p1->next;
        while(p2 != NULL)
        {
            if(pre == p1)
            {
                pre = p2;
                p2 = p2->next;
                continue;
            }
            //put p2 to p1->next;
            ListNode* tmpnext = p2->next;
            
            ListNode* tmp = p1->next;
            p1->next = p2;
            p2->next = tmp;
            
            pre->next = tmpnext;
            
            p2 = tmpnext;
        }
        
        //链表从头和从正中间逐个比较，判断链接是否为回文
        p2 = head;
        p1 = p1->next;
        while(p1 != NULL && p2!=NULL)
        {
            if(p1->val != p2->val)
                return false;
            p1 = p1->next;
            p2 = p2->next;
        }

        return true;
    }
};