/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ #include <vector> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param head ListNode类 the head * @return bool布尔型 */ bool isPail(ListNode* head) { // write code here vector<int> v; ListNode* cur = head; while (cur) { v.push_back(cur->val); cur = cur->next; } int left = 0, right = v.size() - 1; while (left < right) { if (v[left] != v[right]) { return false; } ++left; --right; } return true; } };