[LeetCode]147. Insertion Sort List

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* sortedHead = new ListNode(-1);
        ListNode* pCur = head;
        while(pCur != NULL){
            //保存pCur的next节点
            ListNode *pNext = pCur->next;

            // 从sortedHead的next节点开始，找到节点应该插入位置的前驱节点
            ListNode *pCurSort = sortedHead;
            while(pCurSort->next != NULL && pCurSort->next->val < pCur->val)
                pCurSort = pCurSort->next;

            // 插入
            pCur->next = pCurSort->next;
            pCurSort->next = pCur;

            // 遍历下一个节点
            pCur = pNext;
        }
        return sortedHead->next;
    }
};