[leetcode]234. Palindrome Linked List

[leetcode]234. Palindrome Linked List

---

Analysis

厉害的人总是那么的厉害呀~—— [菜鸡反省中~]

Given a singly linked list, determine if it is a palindrome.
判断链表是否是回文链表。用快慢指针找到链表中点，然后可以用栈来存储前半部分链表或者反转后半部分指针。

Implement

方法一：

/**
 * 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;
        ListNode* slow = head;
        stack<int> mystack;
        mystack.push(head->val);
        while(fast->next && fast->next->next){
            slow = slow->next;
            fast = fast->next->next;
            mystack.push(slow->val);
        }
        if(fast->next == NULL)
            mystack.pop();
        while(slow->next){
            slow = slow->next;
            int t = mystack.top();
            mystack.pop();
            if(t != slow->val)
                return false;
        }
        return true;
    }
};

方法二：

/**
 * 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;
        ListNode* slow = head;
        while(fast->next && fast->next->next){
            slow = slow->next;
            fast = fast->next->next;
        }
        ListNode* cur = slow->next;;
        ListNode* pre = head;
        while(cur->next){
            ListNode* t = cur->next;
            cur->next = t->next;
            t->next = slow->next;
            slow->next = t;
        }
        while(slow->next){
            slow = slow->next;
            if(slow->val != pre->val)
                return false;
            pre = pre->next;
        }
        return true;
    }
};