Q:
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]
.
问题:给定一个数字数组,将其所有0项放在数组末尾,且其他元素按其原来的顺序排列。(注:数组不复制,使操作语句数量最小化)
思路一:以0项计数,遍历数组时,将非零项前移当前发现0项数目个位置,本项置0,一直到遍历完成。
public void moveZeroes(int[] nums) {
for(int i=0,j=0;i<nums.length;i++){
if(nums[i]==0){
j++;
continue;
}else if(j==0){
continue;
}else{
nums[i-j]=nums[i];
nums[i]=0;
}
}
}
思路二:以非0项计数,遍历数组时,当发现一个非0项,就将其放置在lastNonZeroFoundAt记录的位置,之后lastNonZeroFoundAt++,直至遍历完成,随后将数组后nums.length-lastNonZeroFoundAt个项置0.
public void moveZeroes(int[] nums) {
int lastNonZeroFoundAt = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 0) {
nums[lastNonZeroFoundAt++] = nums[i];
}
}
for (int i = lastNonZeroFoundAt; i < nums.length; i++) {
nums[i] = 0;
}
}