283. Move Zeroes.cpp

//link: 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.

Example:

Input: [0,1,0,3,12]
Output: [1,3,12,0,0]
Note:

You must do this in-place without making a copy of the array.
Minimize the total number of operations.
*/

/*
Result:
Runtime: 12 ms, faster than 85.56% of C++ online submissions for Move Zeroes.
Memory Usage: 9.2 MB, less than 100.00% of C++ online submissions for Move Zeroes.
*/

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