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:

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

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

public class Solution {
   	 public void moveZeroes(int[] nums) {
	        int i=0,j=1,k=0;//两个游标，一个指0，一个指非0
	        boolean flag=false;
	        int temp;
	        for(;i<nums.length;i++)
	        {
	        	if(nums[i]==0)
	        	{
	        		j=i+1;
	        		break;
	        	}
	        }
	        if(i!=nums.length)
	        {
	        	
	        for(;j<nums.length;j++)
	        {
	        	if(nums[j]==0&&flag==false)
	        	{
	        		flag=true;
	        		k=j;
	        	}
	        	if(nums[j]!=0)
	        	{
	        		temp=nums[j];
	        		nums[j]=nums[i];
	        		nums[i]=temp;
	        		if(flag)
	        		{
	        			i=k;
	        			flag=false;
	        			j=i;	
	        		}
	        		else
	        		{
	        			i=j;
	        		}
	        	
	        		
	        	}
	        }
	    }
	 }
}

第二种方法：

public class Solution {
    //[1, 3]
    public void moveZeroes(int[] nums) {
        int i=0;
        int j=0;
        while(j<nums.length) {
            if(nums[j]!=0) {
               if(j!=i) { 
                    nums[i++] = nums[j];
                    nums[j] = 0;
               } else {
                   ++i;
               }
            } 
            ++j;
        }
    }
}