說(shuō)起來(lái)這個(gè)題目真的是很簡(jiǎn)單的，但是很容易遺忘基礎(chǔ)方法。

The main propose of this question is Two Pointer method. The first pointer is used to identify if current values is Zero or not, and the following pointer will record the position of the earliest zero before the first pointer.

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