-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution086.cpp
More file actions
64 lines (57 loc) · 1.3 KB
/
solution086.cpp
File metadata and controls
64 lines (57 loc) · 1.3 KB
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
/**
* Partition List
*
* cpselvis([email protected])
* September 15th, 2016
*/
#include<iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* partition(ListNode* head, int x) {
ListNode *smallHead = new ListNode(-1);
ListNode *biggerHead = new ListNode(-1);
ListNode *smallTail = smallHead;
ListNode *biggerTail = biggerHead;
while (head != NULL)
{
if (head -> val < x)
{
smallTail -> next = head;
head = head -> next;
smallTail = smallTail -> next;
smallTail -> next = NULL;
}
else
{
biggerTail -> next = head;
head = head -> next;
biggerTail = biggerTail -> next;
biggerTail -> next = NULL;
}
}
smallTail -> next = biggerHead -> next;
return smallHead -> next;
}
};
int main(int argc, char **argv)
{
ListNode *head = new ListNode(1);
head -> next = new ListNode(4);
head -> next -> next = new ListNode(3);
head -> next -> next -> next = new ListNode(2);
head -> next -> next -> next -> next = new ListNode(5);
head -> next -> next -> next -> next -> next = new ListNode(2);
Solution s;
ListNode *p = s.partition(head, 3);
while (p != NULL)
{
cout << p -> val << endl;
p = p -> next;
}
}