-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
86.java
71 lines (67 loc) · 1.95 KB
/
86.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
68
69
70
71
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode partition(ListNode head, int x) {
if(head==null||head.next==null) return head;
ListNode l1 = new ListNode(0);
ListNode l2 = new ListNode(0);
ListNode cur1 = l1;
ListNode cur2 = l2;
ListNode cur = head;
while(cur!=null){
if(cur.val<x){
cur1.next = cur;
cur1 = cur1.next;
}
else{
cur2.next = cur;
cur2 = cur2.next;
}
cur = cur.next;
}
cur2.next = null;
cur1.next = l2.next;
return l1.next;
}
}
__________________________________________________________________________________________________
sample 34200 kb submission
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode partition(ListNode head, int x) {
if(head == null) return null;
ListNode node = new ListNode(0);
ListNode result = node;
node.next = head;
ListNode greatHead = new ListNode(0);
ListNode greatTail = greatHead;
while(node.next != null){
if(node.next.val >= x){
greatTail.next = node.next;
greatTail = node.next;
node.next = greatTail.next;
}else{
node = node.next;
}
}
node.next = greatHead.next;
greatTail.next = null;
return result.next;
}
}
__________________________________________________________________________________________________