LeetCode 234. Palindrome Linked List

最新推荐文章于 2022-04-04 23:52:01 发布

David_DLUT

最新推荐文章于 2022-04-04 23:52:01 发布

阅读量211

点赞数

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

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941563

版权

LeetCode 专栏收录该内容

42 篇文章 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:
    bool isPalindrome(ListNode* head) {
        int len = 0;
        for (ListNode* temp = head; temp != NULL; temp = temp->next) {
            ++len;
        }
        ListNode *right = head;
        for (int i = 0; i < (len + 1) / 2; ++i) {
            right = right->next;
        }
        right = reverseList(right);
        while (right != NULL) {
            if (right->val != head->val) {
                return false;
            }
            right = right->next;
            head = head->next;
        }
        return true;
    }
private:
    ListNode* reverseList(ListNode* head) {
        ListNode *pre = NULL;
        ListNode *cur = NULL;
        while (head != NULL) {
            cur = head;
            head = head->next;
            cur->next = pre;
            pre = cur;
        }
        return pre;
    }
};