https://leetcode.com/problems/insertion-sort-list


Runtime: 4 ms, faster than 98.61% of Go online submissions for Insertion Sort List.
Memory Usage: 3.7 MB, less than 12.50% of Go online submissions for Insertion Sort List.


```go
func insertionSortList(head *ListNode) *ListNode {
    //8:03
    l := make([]int, 0)
    node := head
    for node != nil {
        l = append(l, node.Val)
        node = node.Next
    }
    
    sort.Ints(l)
    
    i := 0
    node = head
    for node != nil {
        node.Val = l[i]
        i += 1
        node = node.Next
    }
    
    return head
    //8:05
}
```