题目
对链表插入排序
思路
初始换一个哨兵和cur,pre每次开始都指向dummy,然后比较pre-next和cur的值,插入,然后cur指向下一个。
def insert_sortlink(link):
dummy = Node()
cur = link.head.next
while cur is not None:
pre = dummy
while pre.next is not None and pre.next.value < cur.value:
pre = pre.next
temp = cur.next
cur.next = pre.next
pre.next = cur
cur = temp
return dummy.next