编号147
涉及知识点:链表,快速排序
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode insertionSortList(ListNode head) {
if(head == null)
{
return head;
}
ListNode dummyhead = new ListNode(0);
dummyhead.next = head;
ListNode loadcade = head;
ListNode curr = head.next;
while(curr!=null)
{
if(loadcade.val<=curr.val)
{
loadcade = loadcade.next;
}
else
{
ListNode prev= dummyhead;
while(prev.next.val<=curr.val)
{
prev = prev.next;
}
loadcade.next = curr.next;
curr.next = prev.next;
prev.next = curr;
}
curr = loadcade.next;
}
return dummyhead.next;
}
}