Insertion Sort List

我的代码好丑……

算了能用就行了，关键的点是，多设几个变量吧，似乎也没什么不好。

/**
 * 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) {
        if (head == NULL)
            return NULL;
        ListNode * fake = new ListNode(INT_MIN);
        fake->next = head;
        ListNode *p = fake, *q = head->next;
        head->next = NULL;
        while (q != NULL) {
            p = fake;
            ListNode *q_next = q->next;
            bool success = false;
            while (p->next != NULL) {
                if (q->val < p->next->val) {
                    q->next = p->next;
                    p->next = q;
                    q = q_next;
                    success = true;
                    break;
                }
                else
                    p = p->next;
            }
            if (!success) {
                p->next = q;
                q->next = NULL;
                q = q_next;
            }
        }
        return fake->next;
    }
};

http://oj.leetcode.com/problems/insertion-sort-list/