Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.

For example, givennums = [0, 1, 0, 3, 12], after calling your function,numsshould be[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.

Credits:
Special thanks to@jianchao.li.fighterfor adding this problem and creating all test cases.

Subscribeto see which companies asked this question.

Hide Tags

Array

Two Pointers

Hide Similar Problems

(E) Remove Element

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