[LeetCode]Move Zeroes

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.

迭代，删除0，最后补全就OK。

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