Leetcode - Sort List

iteye_17352

于 2015-08-15 17:41:46 发布

阅读量89

点赞数

CC 4.0 BY-SA版权

分类专栏： Sort Divide and Conque 文章标签：数据结构与算法

本文链接：https://blog.youkuaiyun.com/iteye_17352/article/details/82639080

Sort 同时被 2 个专栏收录

9 篇文章

订阅专栏

Divide and Conque

8 篇文章

订阅专栏

本文详细介绍了如何通过二分链表、递归排序子链表并合并已排序子链表来实现链表的O(nlogn)时间排序，同时保持常空间复杂度。

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

Sort a linked list in O(n log n) time using constant space complexity.

[分析] 将链表二分，递归排序子链表，然后merge 已排序的两子链表。


public class Solution {
    public ListNode sortList(ListNode head) {
        if (head == null || head.next == null)
            return head;
        // split the list in a 2 pointer style
        ListNode p = head, q = head;
        while (q.next != null) {
            q = q.next;
            if (q.next != null) {
                q = q.next;
                p = p.next;
            }
        }
        // sort 2 sublists
        ListNode half1 = head, half2 = p.next;
        p.next = null;
        half1 = sortList(half1);
        half2 = sortList(half2);
        // merge 2 sublist
        ListNode dummy = new ListNode(0);
        p = dummy;
        while (half1 != null && half2 != null) {
            if (half1.val < half2.val) {
                dummy.next = half1;
                half1 = half1.next;
            } else {
                dummy.next = half2;
                half2 = half2.next;
            }
            dummy = dummy.next;
        }
        if (half1 != null) {
            dummy.next = half1;
        }
        if (half2 != null) {
            dummy.next = half2;
        }
        return p.next;
    }
}