LeetCode 移动零

Posted 2021-09-13 xhBruce

283. 移动零

• 统计连续“0”的个数,并不进行交换
• 冇有“0”也不进行交换
• 在与不为“0”数字交换

class Solution {
    public void moveZeroes(int[] nums) {
        int count = 0;

        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                count++;
                continue;
            }
            if (count == 0) {
                continue;
            }

            nums[i - count] = nums[i];
            nums[i] = 0;
        }
    }
}