-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAlternate_positive_and_negetive_numbers.cpp
65 lines (51 loc) · 1.29 KB
/
Alternate_positive_and_negetive_numbers.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
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution {
public:
void rearrange(vector<int> &arr) {
int n = arr.size();
vector<int> pos;
vector<int> neg;
for(int i = 0; i < n; i++)
{
if(arr[i] >= 0) pos.push_back(arr[i]);
else neg.push_back(arr[i]);
}
int i = 0, j = 0, k = 0;
while(i < pos.size() && j < neg.size()) {
arr[k++] = pos[i++];
arr[k++] = neg[j++];
}
while(i < pos.size())
arr[k++] = pos[i++];
while(j < neg.size())
arr[k++] = neg[j++];
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
cin.ignore();
while (t--) {
vector<int> arr;
string input;
int num;
getline(cin, input);
stringstream s2(input);
while (s2 >> num) {
arr.push_back(num);
}
Solution ob;
ob.rearrange(arr);
for (int i = 0; i < arr.size(); i++) {
cout << arr[i] << " ";
}
cout << "\n";
}
return 0;
}
// } Driver Code Ends