Move Zeroes——Leetcode

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元素放到前面，并且保证非0元素顺序不变。

解题思路，从前往后遍历，遇见0则cnt++，遇见非0则往前移cnt个，最后把后cnt个设置为0就可以了。

public void moveZeroes(int[] nums) {
if(nums==null||nums.length==0){
return;
}
int cnt = 0;
for(int i=0;i<nums.length;i++){
if(nums[i]==0){
cnt++;
}else{
nums[i-cnt]=nums[i];
}
}
if(cnt>0){
Arrays.fill(nums,nums.length-cnt,nums.length,0);
}
}