Palindrome Linked List 链表是否对称

Given a singly linked list, determine if it is a palindrome.

Example 1:

Input: 1->2
Output: false
Example 2:

Input: 1->2->2->1
Output: true
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:
    bool isPalindrome(ListNode* head) {
        stack<int> h;
        int len = 0, half;
        ListNode *cur = head;
        while(cur){
            cur = cur->next;
            len++;
        }
        cur = head;
        half = len / 2;
        while(half--){
            h.push(cur->val);
            cur = cur->next;
        }
        if(len % 2) cur = cur->next;
        while(cur && cur->val == h.top()){
            cur = cur->next;
            h.pop();
        }
        if(h.empty()) return true;
        return false;
    }
};

解法二：将前半直接翻转与后半比较。

class Solution {
public:
    bool isPalindrome(ListNode* head) {
        if(head==NULL||head->next==NULL)
            return true;
        ListNode* slow=head;
        ListNode* fast=head;
        while(fast->next!=NULL&&fast->next->next!=NULL){
            slow=slow->next;
            fast=fast->next->next;
        }
        slow->next=reverseList(slow->next);
        slow=slow->next;
        while(slow!=NULL){
            if(head->val!=slow->val)
                return false;
            head=head->next;
            slow=slow->next;
        }
        return true;
    }
    ListNode* reverseList(ListNode* head) {
        ListNode* pre=NULL;
        ListNode* next=NULL;
        while(head!=NULL){
            next=head->next;
            head->next=pre;
            pre=head;
            head=next;
        }
        return pre;
    }
};