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.

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

1
2
3
4
5
6
7
8
9
10
11
12
13
14
public class Solution {
    public void moveZeroes(int[] nums) {
        if (nums != null && nums.length > 0) {
            for (int i = 0, lastNonZero = 0; i < nums.length; i++) {
                if (nums[i] != 0) {
                    //swap
                    int temp = nums[lastNonZero];
                    nums[lastNonZero++] = nums[i];
                    nums[i] = temp;
                }
            }
        }
    }
}