Sort List
Sort the list from smallest to largest and return the head of the sorted list. Equal values can stay in any order, since they look the same. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [4,2,1,3]
returns [1,2,3,4]
Sorted: 1, 2, 3, 4.
Example 2
head [-1,5,3,4,0]
returns [-1,0,3,4,5]
Negatives go first.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.