Move Zeroes

nums = [2,0,4,0,9]

[2,4,9,0,0]

public class Solution {
    public void moveZeroes(int[] nums) {
        // Your code goes here
    }
}

Explanation

We can solve this problem by keeping a pointer i that iterates through the array and another pointer nextNonZero that points to the position where the next non-zero element should be placed. We can then swap the elements at i and nextNonZero if the element at i is non-zero. This way, we can maintain the relative order of the non-zero elements while moving all the zeroes to the end of the array.

Solution

public static void moveZeroes(int[] nums) {
    int nextNonZero = 0;
    for (int i = 0; i < nums.length; i++) {
        if (nums[i] != 0) {
            int temp = nums[nextNonZero];
            nums[nextNonZero] = nums[i];
            nums[i] = temp;
            nextNonZero++;
        }
    }
}