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
| /**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode sortList(ListNode head) {
if(head == null){
return null;
}
if(head.next == null){
return head;
}
ListNode l,r;
ListNode p1,p2;
l= head;
r= head;
p1= head;
p2 = head;
while(p2 != null){
p2 = p2.next;
if(p2 != NULL){
p2 = p2.next;
p1 = p1/next;
}
}
r = p1.next;
p1.next = null;
//end
ListNode left = sortList(l);
ListNode right = sortList(r);
//merge
ListNode pHead = null;
ListNode last = null;
while(left != null && right != null){
if(left.val >= right.val){
last = right;
right = right.next;
}else{
last = left;
left = left.next;
}
last.next = null;
if(pHead == null){
pHead = last;
}else{
pHead.next = last;
}
}
if(right != null){
last.next = right;
}
if(left != null){
last.next = left;
}
return pHead;
}
}
|