请判断一个链表是否为回文链表
回文:即对称
思路:本题的核心就是将后半段逆置,然后比较前后半段是否相等即可。首先找到中间节点,再逆置后半段,最后前后段逐个比较是否相等;其中第1、2步骤都在之前刷过的题中都有所涉及,本题最最重要的是找到问题的突破口。
/**
* 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:
ListNode* reverseList(ListNode* head)
{
ListNode* prev = nullptr;
ListNode* curr = head;
while (curr != nullptr)
{
ListNode* nextTemp = curr->next;
curr->next = prev;
prev = curr;
curr = nextTemp;
}
return prev;
}
bool isPalindrome(ListNode* head) {
//1.找到中间节点
ListNode* slow,*fast;
slow = fast = head;
while(fast && fast->next)
{
slow = slow->next;
fast = fast->next->next;
}
//2.逆置后半段
ListNode* half = reverseList(slow);
//3.判断前后半段是否都相等
while(half && head)
{
if(half->val != head->val)
{
return false;
}
half = half->next;
head = head->next;
}
return true;
}
};