public class Solution {
public void moveZeroes(int[] nums) {
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 0) {
count++;
}
}
int p = 0, q;
while(p < count && nums[p] != 0){
p++;
}
q = p + 1;
while (p < count) {
while (nums[q] == 0) {
q++;
}
nums[p] = nums[q];
p++;
q++;
}
for (int i = p; i < nums.length; i++) {
nums[i] = 0;
}
}
}
Move Zeroes
最新推荐文章于 2022-09-09 22:57:00 发布