283. 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.

 

class Solution {

    public void moveZeroes(int[] nums) {

       if (nums == null || nums.length == 0)

          return;

       int insertpos = 0;

       for (int data : nums) 

           if (data != 0)

              nums[insertpos++] = data; //只把非0的元素找出来，放到nums数组里

       while (insertpos < nums.length)

          nums[insertpos++] = 0; //长度对不上，补0

    }

}