Leetcode 234. Palindrome Linked List (Easy) (cpp)

最新推荐文章于 2020-02-11 17:45:06 发布

原创最新推荐文章于 2020-02-11 17:45:06 发布 · 664 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Two Pointers

36 篇文章

订阅专栏

本文介绍了一种判断单链表是否为回文的有效算法。通过找到链表中点，反转后半部分链表，并比较前后两部分节点值来判断链表是否为回文。该算法易于理解和实现。

Leetcode 234. Palindrome Linked List (Easy) (cpp)

Tag: Linked List, Two Pointers

Difficulty: Easy

/*

234. Palindrome Linked List (Easy)

Given a singly linked list, determine if it is a palindrome.

*/
/**
 * 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 *mid = head, *last = head;
        while (last -> next && last -> next -> next) {
            mid = mid -> next;
            last = last -> next -> next;
        }
        mid -> next = reverse(mid -> next);
        mid = mid -> next;
        while (mid != NULL) {
            if (mid -> val != head -> val) {
                return false;
            }
            mid = mid -> next;
            head = head -> next;
        }
        return true;
    }
private:
    ListNode* reverse(ListNode* head) {
        if (head == NULL || head -> next == NULL) {
            return head;
        }
        ListNode *p = head, *prev = NULL;
        while (head != NULL) {
            ListNode *post = head -> next;
            head -> next = prev;
            prev = head;
            head = post;
        }
        return prev;
    }
};