* Move Zeros

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.

Tips:

插入排序：

用insertPosition先找不是0的插进去然后后面全赋0。 O(n)

Code:

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