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

尝试自写比较函数，没有成功，

代码：

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        
        int num=0;
        for(auto p= nums.begin();p!= nums.end();)
        {
            if(*p==0)
            {
                nums.erase(p);
                ++num;
            }
            else
            {
                ++p;
            }
        }
        for(int t=0; t<num ;++t)
        {
            nums.push_back(0);
        }
        return;
    }
};