283. Move Zeroes

题目
283.MoveZeroes
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.

class Solution {
    public void moveZeroes(int[] nums) {

        //Move all the zeroes to the end of the array

        int j = 0;

        for(int i = 0 ; i < nums.length ;i++){

            if(nums[i] != 0){

                nums[j] = nums[i];
                j++;

            }
        }

        while( j < nums.length){

            nums[j] = 0;
            j++;
        }
    }
}

将所有非0的元素往前排，然后最后再补上少于长度的0。

O（N）