/**
* 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) {
vector<int> nums;
while(head != nullptr){
nums.push_back(head->val);
head = head->next;
}
for(int i = 0, j = nums.size() - 1; i < j; ++i, --j){
if(nums[i] != nums[j]){
return false;
}
}
return true;
}
};
LeetCode 234. 回文链表
最新推荐文章于 2024-10-06 14:10:45 发布