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:

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

【思路】

维护两个指针，i j，i指向nums的第一个0，j指向第一个非零数

package algorithm;

public class MoveZeroes {

	public static void main(String[] args) {
		int[] nums = { 0, 1, 0, 3, 12 };
		moveZeroes(nums);
		for (int i : nums) {
			System.out.print(i + " ");
		}
	}

	public static void moveZeroes(int[] nums) {
		int i = 0;
		int j = 0;
		while (j < nums.length) {
			if (nums[j] != 0) {
				if (i != j) {
					nums[i++] = nums[j];
					nums[j] = 0;
				}else {
					++i;
				}
			}			
			++j;
		}
	}
}