题目:
Given a singly linked list, determine if it is a palindrome.
Follow up:
Could you do it in O(n) time and O(1) space?
题目分析:
1、边界情况:链表为空或者链表长度为1
2、判断回文方法:将后半段翻转,与前半段比较,相同即回文
思路:
1、处理边界:链表为空或者链表长度为1的情况,直接返回head
2、首先找出链表的中间节点(采用快慢指针)
3、写一个链表翻转的函数(新增一个指针方法或者用三个指针的方法),将中间节点开始的链表翻转
4、将前后两段进行比较,判断是否回文
代码:
/**
* 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 == nullptr || head->next == nullptr)
return true;
//先找到链表中间节点
ListNode* slowp = head;
ListNode* fastp = head;
while (fastp->next != nullptr && fastp->next->next != nullptr)
{
fastp = fastp->next->next;
slowp = slowp->next;
}
slowp = slowp->next;
//翻转后半部分链表
ListNode* second = reverse(slowp);
//遍历比较
ListNode* first = head;
while (second)
{
if (first->val != second->val) return false;
first = first->next;
second = second->next;
}
return true;
}
ListNode* reverse(ListNode* head)
{
ListNode* pre = NULL;
ListNode* next = NULL;
while (head)
{
next = head->next;
head->next = pre;
pre = head;
head = next;
}
return pre;
}
};
注:在比较前后两段时,注意简洁的循环条件。只需判断后段的节点是否为空,因为后段长度不会比前段长。