反转一个单链表。

weixin_34321977

于 2018-09-04 03:48:04 发布

阅读量105

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：https://juejin.im/post/5b8e006651882542dd226a89

本文提供了一个简单的Java程序示例，用于反转单链表。通过创建链表节点并连接它们形成链表，然后使用迭代方法来反转该链表，并打印反转前后的链表元素。此示例适用于理解链表的基本操作及迭代反转链表的方法。

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

public class reverseList {
    public static void main(String[] args) {
        ListNode one = new ListNode(1);
        ListNode two = new ListNode(2);
        ListNode three = new ListNode(3);
        ListNode four = new ListNode(4);
        ListNode five = new ListNode(5);
        one.next = two;
        two.next = three;
        three.next = four;
        four.next = five;
        five.next = null;
        printLink(one);
        ListNode head = reverseList(one);
        printLink(head);
    }

    public static void printLink(ListNode head) {
        if (null == head) System.out.println("head is null");
        while (head != null) {
            System.out.println(head.val);
            head = head.next;
        }

    }

    public static ListNode reverseList(ListNode head) {
        if (head == null || head.next == null) return head;
        ListNode prev = null;
        while (null != head) {
            ListNode temp = head.next;
            head.next = prev;
            prev = head;
            head = temp;
        }
        return prev;
    }
}
复制代码