-
Notifications
You must be signed in to change notification settings - Fork 6
/
2149.RearrangeArrayElementsBySign.cpp
70 lines (65 loc) · 1.65 KB
/
2149.RearrangeArrayElementsBySign.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
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
#include<bits/stdc++.h>
#include<vector>
using namespace std;
class Solution
{
public:
vector<int> rearrangeArray(vector<int> &nums)
{
//Time Complexity : O(n)
// Space Complexity : O(n)
queue<int> q;
vector<int> a;
for (int i = 0; i < nums.size(); i++)
{
if (nums[i] > 0)
{
if (a.size() == 0)
{
a.push_back(nums[i]);
if (!q.empty() && q.front() < 0)
{
a.push_back(q.front());
q.pop();
}
continue;
}
if (a.back() < 0)
{
a.push_back(nums[i]);
if (!q.empty() && q.front() < 0)
{
a.push_back(q.front());
q.pop();
}
}
else
{
q.push(nums[i]);
}
}
else if (nums[i] < 0)
{
if (a.size() != 0 && a.back() > 0)
{
a.push_back(nums[i]);
if (!q.empty() && q.front() > 0)
{
a.push_back(q.front());
q.pop();
}
}
else
{
q.push(nums[i]);
}
}
}
while (!q.empty())
{
a.push_back(q.front());
q.pop();
}
return a;
}
};