/**
* 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) {
if(!head||!head->next) return true;
ListNode* slow=head;
ListNode* fast=head;
while(fast&&fast->next){
slow = slow->next;
fast = fast->next->next;
}
if(fast){
slow->next=reverseList(slow->next);
slow=slow->next;
}else{
slow=reverseList(slow);
}
while (slow) {
if (head->val != slow->val) {
return false;
}
slow = slow->next;
head = head->next;
}
return true;
}
ListNode* reverseList(ListNode* head){
if(!head||!head->next) return head;
ListNode* prev=head;
ListNode* p=head->next;
prev->next=nullptr;
ListNode* tmp;
while(p){
tmp=p->next;
p->next=prev;
prev=p;
p=tmp;
}
return prev;
}
};
[Leetcode]234. Palindrome Linked List
最新推荐文章于 2022-04-04 23:52:01 发布