链表反转（全链表反转、链表区间反转）

最新推荐文章于 2024-10-11 18:14:29 发布

原创最新推荐文章于 2024-10-11 18:14:29 发布 · 745 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#LinkedList

Data Structure And Algorithm 专栏收录该内容

26 篇文章

订阅专栏

本文深入探讨了链表数据结构的两种反转方法：迭代法和递归法，并提供了详细的代码实现。同时，还介绍了如何在指定区间内进行链表反转，为读者提供了全面的链表操作指南。

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

1. 全链表反转

/**
 * Reverse a linkedList iteratively, for example
 * 1 -> 3 -> 5 -> 7 -> 9
 * 9 -> 7 -> 5 -> 3 -> 1
 * @param head
 * @return
 */
public static ListNode reverseIteratively(ListNode head) {
    ListNode prev = null;
    while(head != null) {
        ListNode next = head.next;
        head.next = prev;
        prev = head;
        head = next;
    }
    return prev;
}

/**
 * Reverse a linkedList recursively, for example
 * 1 -> 3 -> 5 -> 7 -> 9
 * 9 -> 7 -> 5 -> 3 -> 1
 * @param head
 * @return
 */
public static ListNode reverseRecursively(ListNode head) {
    if(head == null || head.next == null) {
        return head;
    }else {
        ListNode newHead = reverseRecursively(head.next);
        head.next.next = head;
        head.next = null;
        return newHead;
    }
}

2. 链表区间反转

/**
 * Reverse a linkedList in a given interval, for example
 * 1 -> 3 -> 5 -> 7 -> 9
 * ↑                   ↑
 * 1 -> 7 -> 5 -> 3 -> 9
 * @param nodeLeft
 * @param nodeRight
 */
public static void intervalReverse(ListNode nodeLeft, ListNode nodeRight) {
    if(nodeLeft == nodeRight) {
        return;
    }else{
        ListNode last = nodeLeft.next;
        ListNode cur = last.next;
        while(cur != nodeRight) {
            last.next = cur.next;
            cur.next = nodeLeft.next;
            nodeLeft.next = cur;
            cur = last.next;
        }
    }
}