-
Notifications
You must be signed in to change notification settings - Fork 2
/
SortList148V3.java
67 lines (63 loc) · 1.48 KB
/
SortList148V3.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package linkedList;
import java.util.LinkedList;
import java.util.Queue;
public class SortList148V3 {
public ListNode sortList(ListNode head) {
if (head == null || head.next == null)
return head;
Queue<ListNode> queue = new LinkedList<ListNode>();
ListNode node = head;
while (node != null) {
ListNode tmp = node.next;
node.next = null;
queue.add(node);
node = tmp;
}
while(queue.size()>1){
queue.add(merge(queue.poll(), queue.poll()));
}
return queue.poll();
}
public ListNode merge(ListNode l1, ListNode l2) {
if (l1 == null || l2 == null) {
return l1 == null ? l2 : l1;
}
ListNode result = new ListNode(0);
ListNode preNode = result;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
preNode.next = l1;
l1 = l1.next;
} else {
preNode.next = l2;
l2 = l2.next;
}
preNode = preNode.next;
}
if (l1 != null) {
preNode.next = l1;
}
if (l2 != null) {
preNode.next = l2;
}
return result.next;
}
public static void main(String[] args) {
ListNode node1 = new ListNode(-1);
ListNode node2 = new ListNode(5);
ListNode node3 = new ListNode(8);
ListNode node4 = new ListNode(4);
ListNode node5 = new ListNode(0);
ListNode node6 = new ListNode(6);
node1.next = node2;
node2.next = node3;
node3.next = node4;
node4.next = node5;
node5.next = node6;
ListNode head = new SortList148V3().sortList(node1);
while(head!=null){
System.out.print(head.val+"\t");
head = head.next;
}
}
}