LeetCode:Move Zeros

Problem:

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.       
3. similiar problem:remove element.                                         
   

   class Solution {
   public:
       void moveZeroes(vector<int>& nums) {
           
           int index=0;
           int m=nums.size();
           for(int i=0;i<m;i++)
           {
               if(nums[i])
                   nums[index++]=nums[i];
           }
           
           for(int j=index;j<m;j++)
               nums[j]=0;
       }
   };