-
Notifications
You must be signed in to change notification settings - Fork 2
/
InsertionSortList.java
36 lines (33 loc) · 970 Bytes
/
InsertionSortList.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode insertionSortList(ListNode head) {
if (head == null || head.next == null) {
return head;
}
ListNode dummy = new ListNode(Integer.MIN_VALUE);
dummy.next = head;
ListNode sorted = head;
while (sorted.next != null) {
if (sorted.next.val >= sorted.val) {
sorted = sorted.next;
} else {
ListNode p = dummy;
while (p.next.val < sorted.next.val) {
p = p.next;
}
ListNode tmp = sorted.next;
sorted.next = sorted.next.next;
tmp.next = p.next;
p.next = tmp;
}
}
return dummy.next;
}
}