2020-08-19-对链表进行插入排序（O(1) 的空间复杂度）

最新推荐文章于 2023-02-21 13:17:17 发布

皮蛋zzz

最新推荐文章于 2023-02-21 13:17:17 发布

阅读量278

点赞数

分类专栏： LEETCODE 数据结构算法

本文链接：https://blog.csdn.net/weixin_43221993/article/details/108096087

版权

LEETCODE 同时被 3 个专栏收录

108 篇文章 0 订阅

订阅专栏

数据结构

68 篇文章 0 订阅

订阅专栏

算法

17 篇文章 0 订阅

订阅专栏

代码参考来自：
https://leetcode-cn.com/problems/insertion-sort-list/comments/

	 public ListNode insertionSortList(ListNode head) {
        ListNode dummy = new ListNode(-1);
        dummy.next = head;
        ListNode pre;
        while (head != null && head.next != null) {
            if(head.val < head.next.val) {
                head = head.next;
                continue;
            }
            pre = dummy;
            while (pre.next.val < head.next.val) pre = pre.next;
            ListNode curr = head.next;
            head.next = curr.next;
            curr.next = pre.next;
            pre.next = curr;
        }
        return dummy.next;
    }
    public void printNode(ListNode head) {
        while(head != null) {
            System.out.print(head.val + "->");
            head = head.next;
        }
    }
    @Test
    public void test() {
        ListNode head = new ListNode(4);
        head.next = new ListNode(2);
        head.next.next= new ListNode(1);
        head.next.next.next = new ListNode(3);
        ListNode node = insertionSortList(head);
        printNode(node);
    }