LC.148.Sort List

最新推荐文章于 2025-04-06 10:07:03 发布

转载最新推荐文章于 2025-04-06 10:07:03 发布 · 120 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/davidnyc/p/8471352.html

本文介绍了一种使用归并排序思想实现的链表排序算法，该算法可以在O(nlogn)的时间复杂度内完成排序，并且仅使用常数级别的额外空间。文章通过递归的方式将链表分为两半，再分别对这两部分进行排序，最后合并两个有序链表得到最终排序结果。

https://leetcode.com/problems/sort-list/description/
Sort a linked list in O(n log n) time using constant space complexity.
找到中点之后的处理，和 143 "Reorder List" 是一样的 : 然后把tail 传后面去

ListNode tail = mid.next ;
//cut it off
mid.next = null ;

time: o(nlogn) space: o(n): recursive with n stacks

 1 public ListNode sortList(ListNode head) {
 2         if (head == null || head.next == null) return head ;
 3         //merge sort
 4         //find the mid,
 5         ListNode mid = getMid(head) ;
 6         ListNode tail = mid.next ;
 7         //cut it off
 8         mid.next = null ;
 9         //recursive
10         ListNode firstHead = sortList(head) ;
11         ListNode secHead = sortList(tail) ;
12         //merge: same logic as merge two sorted list
13          ListNode newHead = merge(firstHead, secHead);
14          return newHead;
15     }
16 
17     private ListNode merge(ListNode firstHead, ListNode secHead) {
18         ListNode dummy = new ListNode(0) ;
19         ListNode curr = dummy ;
20         while (firstHead != null && secHead != null){
21             if (firstHead.val<secHead.val){
22                 curr.next = firstHead ;
23                 firstHead = firstHead.next ;
24                 curr = curr.next ;
25             } else{
26                 curr.next = secHead ;
27                 secHead = secHead.next ;
28                 curr = curr.next ;
29             }
30         }
31         //corner case: either one side left
32         if (firstHead!=null){
33             curr.next = firstHead ;
34         }
35         if (secHead != null){
36             curr.next = secHead ;
37         }
38         return dummy.next ;
39     }
40 
41     private ListNode getMid(ListNode head){
42         if (head == null ) return head ;
43         ListNode fast = head , slow = head ;
44         while(fast != null && fast.next != null && fast.next.next != null){
45             fast = fast.next.next ;
46             slow = slow.next ;
47         }
48         return slow ;
49     }

转载于:https://www.cnblogs.com/davidnyc/p/8471352.html