Leetcode Algorithms

283. 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:

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

Solution:

/**
 * @param {number[]} nums
 * @return {void} Do not return anything, modify nums in-place instead.
 */
var moveZeroes = function(nums) {
    let N = nums.length;
    let count = 0;
    for (let i = 0; i < N; i ++){
        if(nums[i] !== 0){
            nums[count] = nums[i];
            count ++;
        } 
    }
    while(count < N){
        nums[count] = 0;
        count++;
    }
    return nums;
};

Link