148. Sort List 

Sort a linked list in O(n log n) time using constant space complexity.
Example 1:
Input: 4->2->1->3
Output: 1->2->3->4
Example 2:
Input: -1->5->3->4->0
Output: -1->0->3->4->5






https://www.youtube.com/watch?v=M1TwY0nsTZA


Use merge sort , bottom up manner 

看这个视频

 

posted on 2018-11-08 02:28  猪猪🐷  阅读(58)  评论(0)    收藏  举报

导航