Day 31 （C++） | 暑假刷题训练营

[Dream-Y.ocean]

1、回文链表

class Solution {
public:
    ListNode* left = NULL;
    bool isPalindrome(ListNode* head) {
        left = head;
        return reverse(head);
    }
    bool reverse(ListNode* right)
    {
        if(right == NULL)
            return true;
        bool res = reverse(right->next);
        res = res && (left->val == right->val);
        left = left->next;
        return res;

    }

};