234. 回文链表

/**
 * 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 || !head->next)    return true;
        ListNode* slow=head,* fast=head->next;  //快慢指针用于找到中点
        ListNode *pre=NULL;
        while(fast && fast->next){  //一边遍历一边翻转
            ListNode* tmp=slow->next;
            slow->next=pre;
            pre=slow;
            slow=tmp;
            fast=fast->next->next;
        }
        ListNode* p=slow->next; //p为右边的子链表的首结点
        if(fast){   //如果是偶数个需要多翻转一次
            slow->next=pre; 
            pre=slow;
        }
        while(pre){ //pre为左边的子链表的首结点
            if(pre->val!=p->val)
                return false;
            pre=pre->next;
            p=p->next;
        }
        return true;
    }
};