sort_list

README

< Previous 　　　　　　　　　　　　　　　　 Next >

148. Sort List (Medium)

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

Related Topics

[Sort] [Linked List]

Similar Questions

1. Merge Two Sorted Lists (Easy)
2. Sort Colors (Medium)
3. Insertion Sort List (Medium)