283. Move Zeroes

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) {
                        int j = 0;
                        for(int i = 0; i < nums.length ; i++){
                            if(nums[i] != 0){
                                nums[j++] = nums[i];
                            }
                        }
                        for( ;j < nums.length; j++){
                            nums[j] = 0;
                        }
    }
}