LeetCode-283. Move Zeroes

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

思路分析：将不是0的数放到新的vector里边，然后将nums重新赋值，末尾全补0。

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
       int len = nums.size();
        vector<int> vec;
        for( int i = 0; i < len; i++ ) {
            if( nums[i] != 0 ) {
                vec.push_back( nums[i] );
            }
        }
        int j;
        for( j = 0; j < vec.size(); j++ ) {
            nums[j] = vec[j];
        }
        for( ; j < len; j++ ) {
            nums[j] = 0;
        } 
    }
};