题解 | #判断一个链表是否为回文结构#

//用栈，比较的是值
class Solution {
public:
    /**
     *
     * @param head ListNode类 the head
     * @return bool布尔型
     */
    bool isPail(ListNode* head) {
        stack<ListNode*>stack1;
        ListNode* temp = head;
        while (temp)
        {
            stack1.push(temp);
            temp = temp->next;
        }
        while (!stack1.empty())
        {
            if (stack1.top()->val != head->val)
                return false;
            cout << head->val << "head" << stack1.top()->val << "stack";
            head = head->next;
            stack1.pop();
        }
        return true;
    }
};