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:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

• 题解：第一次做循环遍历消除重复多次出现的0，第二次处理不相连的0是可以实现的。

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int count=0;
        for(vector<int>::iterator iter=nums.begin();iter!=nums.end();iter++){
            if(*iter==0){
                nums.erase(iter);
                nums.push_back(0);
            }
        }
                for(vector<int>::iterator iter=nums.begin();iter!=nums.end();iter++){
            if(*iter==0){
                nums.erase(iter);
                nums.push_back(0);
            }
        }
    }
};

//网上大shen们写的
基本思路都是维持两个指针
public class Solution {
    //[1, 3]
    public void moveZeroes(int[] nums) {
        int i=0;
        int j=0;
        while(j<nums.length) {
            if(nums[j]!=0) {
               if(j!=i) { 
                    nums[i++] = nums[j];
                    nums[j] = 0;
               } else {
                   ++i;
               }
            } 
            ++j;
        }
    }
}