[LeetCode] 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.

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int size = nums.size();
        if(size<=1) return;
        int s = 0, e = 0;
        
        while(s<size) {
            while( s < size && nums[s] == 0) {
                s++;
            }
            if(s == size) break;
            
            swap(nums[s], nums[e]);
            e++;
            s++;
        }
        return;
    }
};