Move All Zeros to the End Without Extra Space. #Leetcode_283

Given an integer array nums, move all 0‘s to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]

Example 2:

Input: nums = [0]
Output: [0]

Constraints:

• 1 <= nums.length <= 104
• -231 <= nums[i] <= 231 - 1

class Solution {
    public void moveZeroes(int[] nums) {
        int numPos = 0;

        for(int num: nums){
            if(num != 0){
                nums[numPos++] = num;
            }
        }

        while(numPos < nums.length){
            nums[numPos++] = 0;
        }

        for(int num:nums){
            System.out.print(num+" ");
        }
       
    }
}

source: https://leetcode.com/problems/move-zeroes/