LeetCode "Move Zeroes"

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        size_t n = nums.size();
        if(n < 2) return;
        
        int i = 0, j = 0;
        while(j < n)
        {
            if(nums[i] != 0) 
            {
                i ++; j = i + 1;
            }
            else if(nums[j] == 0)
            {
                j ++;
            }
            else if (j < n)
            {
                swap(nums[i], nums[j]);
                j = i + 1;
            }
        }
    }
};