Palindrome Linked List

最新推荐文章于 2021-03-02 15:23:07 发布

原创最新推荐文章于 2021-03-02 15:23:07 发布 · 493 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种O(n)时间复杂度和O(1)空间复杂度的算法来判断单链表是否为回文串。通过使用双指针技巧找到链表的中点并反转前半部分链表，从而实现快速判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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?

solution: two pointers, one pointer step 1, the other pointer step 2, find the mid node, reverse the start->mid node.

/**
 * 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 == NULL || head->next == NULL)
            return true;
        ListNode* h1 = head;
        ListNode* h2 = head;
        ListNode* left = NULL;
        ListNode* right = NULL;
        ListNode* before = NULL;
        while(1)
        {
           //even
           if(h2 == NULL)
           {
               right = h1;
               left = before;
               break;
           }
            //odd
           else if(h2->next == NULL){
               left = before;
               right = h1->next;
               break;
           }
           else{
               h2 = h2->next->next;
               ListNode* tmp = h1->next;
               h1->next = before;
               before = h1;
               h1 = tmp;
              }
          }
        while(left!= NULL && right!= NULL){
            if(left->val == right->val)
            {
                left = left->next;
                right = right->next;
            }else{
                return false;
            }
        }
        return true;
    }
};