LeetCode OJ 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.

public class Solution {
	public void moveZeroes(int[] nums) {
		int NumOfZeroes = 0;// 统计数组nums中0的个数
		for (int i = 0; i < nums.length; i++) {
			if (nums[i] == 0) {
				NumOfZeroes++;
				//当数组第i个数后面全是0时，退出外层循环
				if (i + NumOfZeroes == nums.length)
					break;
				//找到i后面的第一个非零数，将它和numms[i]交换
				for (int j = i + NumOfZeroes; j < nums.length; j++) {
					if (nums[j] == 0)
						NumOfZeroes++;
					else {
						nums[i] = nums[j];
						nums[j] = 0;
						// 将第j个数（非零）和第i个数（零）交换位置后，外层循环还会再重复统计一次第j个位置的0，因此这里减去重复的次数
						NumOfZeroes--;
						break;
					}
				}
			}
		}
	}
}