LeetCode-283

题目

结果

代码

借助其它数组

class Solution {
    public void moveZeroes(int[] nums) {
        int[] tmp = new int[nums.length];
        int index = 0;
        for (int num : nums) {
            if (num != 0) {
                tmp[index++] = num;
            }
        }
        System.arraycopy(tmp, 0, nums, 0, nums.length);
    }
}

原地操作

class Solution {
    public void moveZeroes(int[] nums) {
        for (int i = nums.length - 1; i >= 0; i--) {
            if (nums[i] == 0) {
                moveZeroToEnd(nums, i);
            }
        }
    }

    private void moveZeroToEnd(int[] nums, int index) {
        for (int i = index; i < nums.length - 1; i++) {
            if (nums[i + 1] == 0) {
                return;
            } else {
                swap(nums, i, i + 1);
            }
        }
    }

    private void swap(int[] nums, int a, int b) {
        int tmp = nums[a];
        nums[a] = nums[b];
        nums[b] = tmp;
    }
}