Insert Into a Sorted List
The list is sorted from smallest to largest. Insert a new node holding val so the list stays sorted, and return the head. If equal values already exist, the new node may go next to them. 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 [1,3,5]
val 4
returns [1,3,4,5]
4 goes between 3 and 5.
Example 2
head [2,3]
val 1
returns [1,2,3]
1 becomes the new head.
Constraints
0 <= number of nodes <= 100- The list is sorted in non-decreasing order
-100 <= Node.val, val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.