-
Notifications
You must be signed in to change notification settings - Fork 0
/
86. Partition List.cpp
36 lines (32 loc) · 965 Bytes
/
86. 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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* partition(ListNode* head, int x) {
ListNode* before = new ListNode(0);
ListNode* ans = before;
ListNode* after = new ListNode(0);
ListNode* head_after = after;
ListNode* tmp = head;
while(tmp != nullptr){
if(tmp->val >= x){
after->next = new ListNode(tmp->val);
after = after->next;
}else{
before->next = new ListNode(tmp->val);
before = before->next;
}
tmp = tmp->next;
}
before->next = head_after->next;
return ans->next;
}
};