LeetCode 283. Move Zeroes（移动数字0）

原题网址：https://leetcode.com/problems/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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

方法：将非零数字移到前面，空出来的位置填上0.

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