-
Notifications
You must be signed in to change notification settings - Fork 0
/
PartitionList.cpp
42 lines (40 loc) · 1.18 KB
/
PartitionList.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
41
42
#include <vector>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
/* Sol 0
* The problem is solved by swap the node (not the value).
* It will be much easier by splitting the list into two new lists and then concatenating them.
*/
ListNode* partition(ListNode* head, int x) {
ListNode dummy(-1),*left = &dummy,*current = head,*pre=&dummy;
dummy.next = head;
while(current != nullptr){
if(current->val < x){
if(left->next != current){
ListNode *temp = left->next;
left->next = current;
pre->next = current->next;
current->next = temp;
left = current;
current = pre->next;
}
else{
current = current->next;
left = left->next;
pre = pre->next;
}
}
else{
current = current->next;
pre = pre->next;
}
}
return dummy.next;
}
};