[Leetcode] 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) {
if(nums.length<2) return;
label:
for(int i=0;i<nums.length-1;i++)
{
if(nums[i]!=0) continue;
int j=i+1;
while(nums[j]==0)
{
if(j==(nums.length-1)) break label;
j+=1;
}
nums[i]=nums[j];
nums[j]=0;

}
}
}