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].
简便做法：我们只要遇到不为0的元素,就依次放进原本的数组，最后再将剩余的位置填0.
`
public class Solution{
public void moveZeroes(int[] nums) {
int count = 0;
for (int num : nums) {
if (num != 0)
nums[count++] = num;
}
while (count < nums.length)
nums[count++] = 0;
}
}
`
