leetcode206 反转链表两种做法（循环，递归）

最新推荐文章于 2024-09-15 11:40:06 发布

weixin_30241919

最新推荐文章于 2024-09-15 11:40:06 发布

阅读量120

点赞数

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

原文链接：http://www.cnblogs.com/wmxl/p/11291754.html

版权

反转链表 leetcode206

方法1 循环

public ListNode reverseList(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        ListNode now = head;
        while (now.next != null) {
            ListNode temp = now.next;
            now.next = now.next.next;
            temp.next = head;
            head = temp;
        }
        return head;
    }

方法2 递归

public ListNode reverseList2(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        ListNode newHead = reverseList2(head.next);
        ListNode now =newHead;
        while (now.next != null) {
            now = now.next;
        }
        now.next = head;
        head.next = null;
        return newHead;
    }

转载于:https://www.cnblogs.com/wmxl/p/11291754.html