力扣 | 234. 回文链表

最新推荐文章于 2024-09-21 10:02:17 发布

molecule_jp

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量252

点赞数 2

文章标签： leetcode 链表算法

本文链接：https://blog.csdn.net/qq_37247026/article/details/137726476

版权

文章介绍了如何使用快慢指针的方法来判断给定的单链表是否是回文。首先，通过快慢指针找到链表的中间节点，然后反转后半部分链表并与原链表前半部分逐个节点比较。

摘要由CSDN通过智能技术生成

在这里插入图片描述

用到快慢指针！

/**
 * 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;
        ListNode fast = head.next;
        while (fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        ListNode newHead = slow.next;
        slow.next = null;
        ListNode newFastHead = reverseList(newHead);
        ListNode right = newFastHead;
        ListNode left = head;
        while (right != null){
            if(right.val != left.val){
                return false;
            }
            left = left.next;
            right = right.next;
        }
        return true;
    }
    public ListNode reverseList(ListNode head){
        ListNode prev = null;
        ListNode curr = head;
        while (curr != null){
            ListNode next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
    }