题目
用插入排序对链表排序
样例
Given 1->3->2->0->null, return 0->1->2->3->null
解题
public class Solution {
/**
* @param head: The first node of linked list.
* @return: The head of linked list.
*/
public ListNode insertionSortList(ListNode head) {
// write your code here
ListNode dummy = new ListNode(0);
while (head != null) {
ListNode node = dummy;// 待插入链表
//找到插入位置
while (node.next != null && node.next.val < head.val) {
node = node.next;
}
ListNode temp = head.next;
head.next = node.next;
node.next = head;
head = temp;
}
return dummy.next;
}
}