Insertion Sort List
Medium
Topics
Given the head of a singly linked list, sort it in ascending order using insertion sort and return the sorted list.
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]
Constraints
- 1 <= number of nodes <= 5000
- -5000 <= Node.val <= 5000
Run ⌘' · Submit ⌘⏎
SensAI