思路:原地排,将0排到数组的后面
easy,直接遍历一遍,一个index遇到0就不动,遇到非0就赋值,并且index++
public class Solution283 {
public void moveZeroes(int[] nums) {
int index = 0;
for(int i = 0; i < nums.length; i ++){
if(nums[i] != 0)
nums[index++] = nums[i];
}
while(index < nums.length){
nums[index ++] = 0;
}
}
}