Leetcode题解 283. Move Zeroes

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].

Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

第一种解法：（24ms）

public  void moveZeroes(int[] nums) {
        int n = nums.length;
        //用来后面减去移动次数的计数
        int num = n;
        int i = 0;
        while (i < num) {
            if (nums[i] == 0) {
                for (int a = i; a < n - 1; a++) {
                    nums[a] = nums[a + 1];
                }
                nums[n - 1] = 0;
                num--;
            } else {
                i++;
            }
        }
    }

第一种解法：（87ms）

public void moveZeroes(int[] nums) {
        int count = 0;
        int pos = 0;
        int[] b = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] != 0) {
                b[count] = nums[i];
                count++;
            }
        }
        for (int i = 0; i < nums.length; i++) {
            nums[pos] = b[i];
            pos++;
        }
        for (int i = 0; i < nums.length; i++) {
            System.out.print(nums[i] + " ");
        }
    }