LeetCode 234. Palindrome Linked List判断链表是否回文

最新推荐文章于 2020-08-29 20:51:58 发布

yqtaowhu

最新推荐文章于 2020-08-29 20:51:58 发布

阅读量458

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/taoyanqi8932/article/details/51873007

版权

Leetcode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

/************************************************************************
* 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?
************************************************************************/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/

class Solution {
public:
    //find the mid in the List
    ListNode* findMid(ListNode* head) {
        ListNode *slow=head,*fast=head; 
        while (fast&&fast->next) {
            fast=fast->next->next;
            slow=slow->next;
        }
        return slow;
    }
    //reverse the hafl List
    ListNode* reverse(ListNode* head) {
       ListNode *pre=head;ListNode* cur=pre->next;
       pre->next=NULL;
       while (cur) {
           ListNode *nxt=cur->next;
           cur->next=pre;
           pre=cur;
           cur=nxt;
       }
       return pre;
    }
    bool isPalindrome(ListNode* head) {
        if (head==NULL||head->next==NULL) return true;
        ListNode *mid=findMid(head);
        ListNode *pre=reverse(mid);
        while (pre) {
            if (pre->val!=head->val)
                return false;
            pre=pre->next;
            head=head->next;
        }
        return true;
    }
};