147. Insertion Sort List

Sort a linked list using insertion sort.

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    ListNode* insertionSortList(ListNode* head) {        ListNode dummy(-1);        ListNode *cur = head;        while (cur) {            ListNode *tmp = cur->next;            ListNode *prev = &dummy;            while (prev->next && prev->next->val < cur->val) {                prev = prev->next;            }            cur->next = prev->next;            prev->next = cur;            cur = tmp;        }        return dummy.next;    }};