LeetCode 283. Move Zeroes(java)

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.

方法一：recursion

public void moveZeroes(int[] nums) {
        //special case
        if (nums == null || nums.length <= 1) return;
        //base case
        int index = 0;
        //general case
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] != 0) {
                nums[index++] = nums[i];
            }
        }
        for (int i = index; i < nums.length; i++) {
            nums[i] = 0;
        }
        return;
    }

方法二: 读写操作最少的方法，双指针法

public static int moveZeros(int[] nums) {
        if (nums.length == 0) return 0;
        int begin = 0, end = nums.length - 1;
        while (begin < end) {
            while (begin < end && nums[begin] != 0) begin++;
            while (begin < end && nums[end] == 0) end--;
            int temp = nums[begin];
            nums[begin] = nums[end];
            nums[end] = temp;
        }
        if (nums[begin] != 0) return begin + 1;
        else return begin;
    }