leetcode + 判断链表是不是回文的，先存到vector中然后就简单了

class Solution {
public:
    bool isPalindrome(ListNode* head) {
        vector<int> res;
        while (head) {
            res.push_back(head->val);
            head = head->next;
        }
        int i=0, j= res.size()-1;
        while (i<=j) {
            if(res[i]!=res[j]) return false;
            i+=1; j-=1;
        }
        return true;
    }
};