/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool isPalindrome(ListNode* head) {
vector<int> vec;
while(head)
{
vec.push_back(head->val);
head = head->next;
}
if(vec.size() < 2)
{
return true;
}
if(vec.size() == 2)
{
if(vec[0] == vec[1])
{
return true;
}
else
{
return false;
}
}
for(int i = 0; i < vec.size() / 2; i++)
{
if(vec[i] != vec[vec.size() - 1 - i])
{
return false;
}
}
return true;
}
};
leetcode 面试题 02.06. 回文链表
最新推荐文章于 2022-02-02 22:17:24 发布