【leetcode】回文链表/栈/双指针/c++

leetcode极简笔记，主要记录自己写的辣鸡代码

这次写的确实菜

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    bool isPalindrome(ListNode* head) {
        ListNode *slow=head,*fast=head;
        while(fast){
            slow=slow->next;
            if(!fast->next || !fast->next->next)    break;
            fast=fast->next->next;
        }
        stack<int> s;
        while(slow){
            s.push(slow->val);
            if(!slow->next) break;
            slow=slow->next;
        }
        slow=head;
        while(!s.empty()){
            if(s.top()!=slow->val)  return false;
            s.pop();
            slow=slow->next;
        }
        return true;
    }
};