#148
Sort List
medium · verified · 63.9% accepted · 12,966 likes · top 67%
linked list · two pointers · divide and conquer · sorting · merge sort
Description
Given the head of a linked list, return the list after sorting it in ascending order.
Example 1:
Input: head = [4,2,1,3]
Output: [1,2,3,4]
Example 2:
Input: head = [-1,5,3,4,0]
Output: [-1,0,3,4,5]
Example 3:
Input: head = []
Output: []
Solution