LeetCode:Palindrome Linked List

最新推荐文章于 2024-09-14 18:52:56 发布

woquhundan

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量256

点赞数

分类专栏： c++ 文章标签： leetcode 指针链表

本文链接：https://blog.csdn.net/u012043313/article/details/48036659

版权

c++ 专栏收录该内容

13 篇文章 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?

要求时间复杂度为n，想了一下只能用快慢两个指针做，先找到中点，然后倒置后面一半链表比较。写的过程中放了好多低级错误，基础还是要加强啊。

class Solution {
public:
    bool isPalindrome(ListNode* head) {
        if (head == NULL)
        {
            return true;
        }
        ListNode *quick = head;
        ListNode *slow = head;
        while (quick->next && quick->next->next)
        {
            quick  = quick->next->next;
            slow = slow->next;
        }
        ListNode *left = head;
        ListNode *right = revert(slow);
        while (left != NULL)
        {
            if (left->val != right->val)
            {
                return false;
            }
            left = left->next;
            right = right->next;
        }
        return true;
    }
    ListNode* revert(ListNode *head)
    {
        ListNode *p = head->next;
        ListNode *q = head;
        while (p != NULL)
        {
            ListNode *r = p->next;
            p->next = q;
            q = p;
            p = r;
        }
        
        head->next = NULL;
        return q;
    }
    
};