LeetCode-234. Palindrome Linked List [C++][Java]_given the head of a singly linked list, return tru-CSDN博客

本文链接：https://blog.csdn.net/qq_15711195/article/details/126190827

本文介绍了如何解决LeetCode上的第234题——判断单链表是否为回文。通过C++和Java代码展示了两种解决方案，包括使用快慢指针找到链表中间节点并反转后半部分链表，然后逐一比较节点值来判断回文。这两种方法均在O(n)时间和O(1)空间复杂度下完成。

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

LeetCode-234. Palindrome Linked ListLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/palindrome-linked-list/

Given the head of a singly linked list, return true if it is a palindrome.

Example 1:

Input: head = [1,2,2,1]
Output: true

Example 2:

Input: head = [1,2]
Output: false

Constraints:

The number of nodes in the list is in the range [1, 105].
0 <= Node.val <= 9

Follow up: Could you do it in O(n) time and O(1) space?

【C++】

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    bool isPalindrome(ListNode* head) {
        if (!head || !head->next) {return true;}
        ListNode *slow = head, *fast = head;
        while (fast->next && fast->next->next) {
            slow = slow->next;
            fast = fast->next->next;
        }
        fast = reverseList(slow->next);
        while (fast) {
            if (head->val != fast->val) { return false;}
            head = head->next;
            fast = fast->next;
        }
        return true;
    }

    ListNode* reverseList(ListNode* head) {
        ListNode *prev = nullptr, *next;
        while (head) {
            next = head->next;
            head->next = prev;
            prev = head;
            head = next;
        }
        return prev;
    }
};

【Java】

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public boolean isPalindrome(ListNode head) {
        if (head == null || head.next == null) {return true;}
        ListNode slow = head, fast = head;
        while (fast.next != null && fast.next.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        fast = reverseList(slow.next);
        while (fast != null) {
            if (head.val != fast.val) { return false;}
            head = head.next;
            fast = fast.next;
        }
        return true;
    }

    ListNode reverseList(ListNode head) {
        ListNode prev = null, next;
        while (head != null) {
            next = head.next;
            head.next = prev;
            prev = head;
            head = next;
        }
        return prev;
    }
}