leetcode283

1、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补齐就好，然鹅题目不允许～
类似的，对于容器有很多方便的函数嘛～当遇到零时，删掉好了，然后count一下有多少零，最后再添加上嗯～

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int count=0;
        int n=nums.size();
        for(int i=0;i<n;)
            if(!nums[i]){
                nums.erase (nums.begin()+i);
                count++;
                n--;
            }
            else
                i++;
            for(int i=0;i<count;i++)
                nums.push_back(0);
    }
};