-
Notifications
You must be signed in to change notification settings - Fork 0
/
Partition List.cpp
40 lines (35 loc) · 974 Bytes
/
Partition List.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *partition(ListNode *head, int x) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (head == NULL)
return head;
ListNode *small = new ListNode(0), *shead = small;
ListNode *pre = new ListNode(0), *now = head;
pre->next = head;
head = pre;
while (now != NULL) {
if (now->val < x) {
small->next = now;
small = small->next;
now = now->next;
pre->next = now;
}
else {
pre = now;
now = now->next;
}
}
small->next = head->next;
return shead->next;
}
};