LeetCode OJ ：Move Zeroes (移动0)

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.

这个移动必须是在原地一动，不能借助其他的容器。

基本的思想是将所有的不是0的数都往前移动，最后在根据容器的最初大小补上0就可以了

#include <vector>
using namespace std;
class Solution{
public:
    void moveZeros(vector<int> & nums){
        auto sz = nums.size();
        int pos = 0;
        for (int i = 0; i < sz; ++i){
            if (nums[i] != 0)
                nums[pos++] = nums[i];
        }
        for (int i = pos; i < sz; ++i)
            nums[i] = 0;
    }
};

大体上就是这样

java版本代码如下：

public class Solution {
    public void moveZeroes(int[] nums) {
         int pos = 0;
         for(int i = 0; i < nums.length; ++i){
             if(nums[i] != 0){
                 nums[pos++] = nums[i];
             }
         }
         while(pos < nums.length){
             nums[pos++] = 0;
         }
    }
}