283. 移动零 - 力扣(LeetCode) (leetcode-cn.com)https://leetcode-cn.com/problems/move-zeroes/submissions/
class Solution {
public void moveZeroes(int[] nums) {
if (nums == null)
return;
int j = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 0) {
nums[j++] = nums[i];
}
}
for (int i = j; i < nums.length; i++) {
nums[i] = 0;
}
}
}
双变量,一个变量循环一边,另一个变量记录非零的数字的个数。最后末尾置零。