leetcode-Move Zeroes

Difficulty: Easy

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.

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        if(nums.empty())
            return ;
        int size=nums.size();
        
        int left =0;
        int right=0;
        int count=0    ;
        while(right<size){
            if(nums[right]!=0){
                nums[left++]=nums[right];
                ++count;
            }
            ++right;    
        }
    
        for(int i=size-1;i>count-1;--i)
            nums[i]=0;
    }
};