解题思路来自Gary Liu的题解java简洁代码实现
关于这题,dummy
节点很关键,既方便结果的返回,也方便每次遍历的时候从头开始。
class Solution {
public ListNode insertionSortList(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode dummy = new ListNode(0);
ListNode pre = head;
ListNode cur = head.next;
dummy.next = head;
while(cur != null){
if(pre.val <= cur.val){
pre = cur;
cur = cur.next;
} else {
ListNode p = dummy;
while(p.next != cur && p.next.val <= cur.val){
p = p.next;
}
pre.next = cur.next;
cur.next = p.next;
p.next = cur;
cur = pre.next;
}
}
return dummy.next;
}
}