lintcode-173-链表插入排序

173-链表插入排序

用插入排序对链表排序

样例

Given 1->3->2->0->null, return 0->1->2->3->null

标签

排序 链表

思路

先插入一个值为 INT_MIN 的头结点，可以使操作跟简单方便

code

/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param head: The first node of linked list.
     * @return: The head of linked list.
     */
    ListNode *insertionSortList(ListNode *head) {
        // write your code here
        if (head == NULL) {
            return head;
        }

        ListNode *newHead = new ListNode(INT_MIN);
        newHead->next = head;
        ListNode *alSort, *noSort, *p, *q;
        alSort = newHead->next;
        newHead->next = NULL;
        while (alSort != NULL) {
            p = newHead;
            noSort = newHead->next;
            while (noSort != NULL && noSort->val <= alSort->val) {
                p = noSort;
                noSort = noSort->next;
            }
            q = alSort->next;
            alSort->next = p->next;
            p->next = alSort;
            alSort = q;
        }
        return newHead->next;
    }
};

转载于:https://www.cnblogs.com/libaoquan/p/7279089.html