文章来源:https://www.toymoban.com/news/detail-739342.html
/**
* 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) {
if(head == nullptr)
return true;
int count = 0;
ListNode* cur = head;
while(cur)
{
cur = cur->next;
count += 1;
}
int a[count];
cur = head;
for(int i = 0; i < count; i++)
{
a[i] = cur->val;
cur = cur->next;
}
for(int i = 0; i < count/2; i++)
{
if(a[i] != a[count-1-i])
{
return false;
}
}
return true;
}
};
文章来源地址https://www.toymoban.com/news/detail-739342.html
到了这里,关于LEEDCODE 027 回文链表的文章就介绍完了。如果您还想了解更多内容,请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章,希望大家以后多多支持TOY模板网!