Leetcode 283. Move Zeroes

题目链接：https://leetcode.com/problems/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.

 

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int l=nums.size();
        vector<int>  flag(l,0);
        vector<int>  num;
        int t=0;
        for(int i=0;i<l;i++)
        {
             if(nums[i]==0){
                flag[i]=1;
                t++;
             }
        }
        for(int  j=0;j<l;j++)
        {  
            if(flag[j]==0)
             num.push_back(nums[j]);
            else
             continue;
        }
        for(int k=0;k<t;k++)
        {
             num.push_back(0);
        }
        nums=num;
    }
};