-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmoveZerosToEnd.cpp
67 lines (61 loc) · 1.02 KB
/
moveZerosToEnd.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
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
typedef vector<ll> vl;
#define PB push_back
#define ios() ios::sync_with_stdio(false); cin.tie(0);
#define scan(a,n) for(ll i=0;i<n;i++) cin>>a[i];
#define print(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" ";
#define test() ll t; cin>>t; while(t--)
#define endl "\n"
int main()
{
#ifndef ONLINE_JUDGE
freopen ("input.txt","r",stdin);
freopen ("output.txt","w",stdout);
#endif
ios()
ll n, nZero=0;
cin>>n;
vl v(n+1);
scan(v,n)
REP(i,n)
{
if(v[i] != 0)
{
swap(v[i],v[nZero]);
nZero++;
}
}
print(v,n)
return 0;
}
/* Other solution */
// REP(i,n)
// {
// cin>>v[i];
// if(v[i]==0) nZero++;
// }
// ll x=n-1;
// REP(i,n)
// {
// if(v[i]==0)
// {
// while(1)
// {
// loop++;
// if(x < n-nZero)
// break;
// if(v[x]!=0)
// {
// swap(v[i],v[x--]);
// break;
// }
// else
// x--;
// }
// }
// }
// print(v,n)