[leetcode][python]147. Insertion Sort List

147. Insertion Sort List

---

知识点：sort

1. 原题

Sort a linked list using insertion sort.

A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.
With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list

Algorithm of Insertion Sort:

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.
At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
It repeats until no input elements remain.

Example 1:

Input: 4->2->1->3
Output: 1->2->3->4
Example 2:

Input: -1->5->3->4->0
Output: -1->0->3->4->5

2. 题意

使用list来实现插入sort

3. 思路

使用多个指针来实现。当head的next更大时，不需要操作，否则就将那个结点temp取出，并使用next.next删除这个结点，随后对新的list中的val进行判断，若是temp更大，就让新的list继续向后找，直到找到比temp大的结点，然后将这个结点后面的结点都赋给temp.next，并将temp放在那个结点之后，完成插入。

4.代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def insertionSortList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        an=ListNode(0)
        an.next=head
        
        if not head or not head.next: return head
        while head.next:
            if head.next.val>=head.val:
                head=head.next
            else:
                t=head.next
                head.next=head.next.next
                l=an
                while l.next and l.next.val<t.val:
                    l=l.next
                t.next=l.next
                l.next=t
        return an.next
        

5. Reference

https://blog.csdn.net/fuxuemingzhu/article/details/80785630