# Middle-题目97：148. Sort List

52人阅读 评论(0)

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

public class Solution {
public ListNode sortList(ListNode h){
if(h == null || h.next == null)
return h;

/*split into three list*/
ListNode fakesmall = new ListNode(0), small = fakesmall;
ListNode fakelarge = new ListNode(0), large = fakelarge;
ListNode fakeequal = new ListNode(0), equal = fakeequal;

ListNode cur = h; // pivot is h.
while(cur != null){
if(cur.val < h.val){
small.next = cur;
small = small.next;
}
else if(cur.val == h.val){
equal.next = cur;
equal = equal.next;
}
else{
large.next = cur;
large = large.next;
}

cur = cur.next;
}

// put an end.
small.next = equal.next = large.next = null;
// merge them and return . merge reusing below one. merge for quicksort should be simplified.
return merge(merge(sortList(fakesmall.next), sortList(fakelarge.next)),fakeequal.next) ;
}
private ListNode merge(ListNode h, ListNode m){
ListNode fake = new ListNode(0), cur = fake;

while(h != null && m != null){

if(h.val < m.val){
cur.next = h;
h = h.next;
}
else{
cur.next = m;
m = m.next;
}
cur = cur.next;
}

cur.next = (h == null ? m : h);

return fake.next;
}
}

8ms,beats 42.09%,众数8ms,31.36%
cmershen的碎碎念：

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：56822次
• 积分：3211
• 等级：
• 排名：第10678名
• 原创：270篇
• 转载：53篇
• 译文：0篇
• 评论：7条
文章分类
最新评论