LeetCode-OJ

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 static void moveZeroes(int[] nums) {
int first=0;
int second=0;
while(second<nums.length) {
if(nums[second]!=0) {
if(second != first) {
nums[first++] = nums[second];
nums[second] = 0;
}
else{
first++;
}
}
second++;
}
}

static void printarray(int []array){
for(int i = 0;i<array.length;i++){
System.out.println(array[i]);
}
}
public static void main(String[] args){
int []nums = new int[]{0, 1, 0, 3, 12};
moveZeroes(nums);
printarray(nums);
}