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.

给定一个数组，将所有的0放到数组的后面，元素之间的相对位置保持不变。我们用双指针来解决。从数组第一个元素开始，如果不为0，就用index指针记录这个值，index++, 直到遍历完数组，这样index的值就是数组中不为0的元素的个数，然后从index开始，将后面的元素变为0。代码如下：

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