Leetcode|234. 回文链表（链表的前后序遍历）

1 反转链表做法

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        auto node = head;
        ListNode* cur = nullptr;
        while (node) {
            auto pre = new ListNode(node->val);
            node = node->next;
            pre->next = cur;
            cur = pre;
        }
        return cur;
    }
    bool isPalindrome(ListNode* head) {
        auto reverseHead = reverseList(head);
        while (head) {
            if (head->val != reverseHead->val) return false;
            head = head->next;
            reverseHead = reverseHead->next;
        }
        return true;
    }
};

2 栈stack

class Solution {
public:
    bool isPalindrome(ListNode* head) {
        auto node = head;
        stack<ListNode*> stk;
        while (node) {
            stk.push(node);
            node = node->next;
        }
        while (head) {
            auto node = stk.top(); stk.pop();
            if (node->val != head->val) return false;
            head = head->next;
        }
        return true;
    }
};

3 递归（链表的前后序遍历）

class Solution {
public:
    ListNode* left;
    bool isPalindrome(ListNode* head) {
        left = head;
        return traverse(head);
    }

    bool traverse(ListNode* right) {
        if (!right) return true;
        bool res = traverse(right->next);
        // 类比树的后序遍历
        res = res && (left->val == right->val);
        // 左指针前进
        left = left->next;
        return res;
    }
};