LeetCode-MyCodesCollection/Array/283. Move Zeroes.cpp at master · 29DCH/LeetCode-MyCodesCollection · GitHub

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
#include <bits/stdc++.h>
using namespace std;
/**
class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        vector<int> a;
        for( int i = 0 ; i < nums.size() ; i ++ ) {
            if ( nums[i] )
                a.push_back( nums[i] );
        }
        for( int i = 0 ; i < a.size() ; i ++ ) {
            nums[i] = a[i];
        }
        for( int i = a.size() ; i < nums.size() ; i ++ ) {
            nums[i] = 0;
        }
    }
};
*/
/**
class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int k=0;
        for( int i = 0 ; i < nums.size() ; i ++ ) {
            if ( nums[i] )
                nums[k ++]=nums[i];
        }
        for( int i = k ; i < nums.size() ; i ++ ) {
            nums[i] = 0;
        }
    }
};
*/

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int k=0;
        for( int i = 0 ; i < nums.size() ; i ++ ) {
            if ( nums[i] )
                if ( i != k )     //¿¼ÂÇµ½È«²¿ÊÇ·Ç0ÔªËØ
                swap(nums[k ++] , nums[i] );
                else
                    k ++;
        }
    }
};

int main()
{
    int arr[] = {0, 1, 0, 3, 12};
    vector<int> vec(arr, arr + sizeof(arr)/sizeof(int) );
    Solution().moveZeroes( vec );
    for( int i = 0 ; i < vec.size() - 1 ; i ++ )
        cout << vec[i] << " ";
    cout << vec [ vec.size() - 1 ] << endl;
    return 0;
}