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.
void moveZeroes(int* nums, int numsSize) {
for(int i=0;i<numsSize;i++){
if(nums[i]==0){
int j=i;
while(nums[j]==0){ //找到nums[i]之后第一个非零元素
j=j+1;
if(j==numsSize) //j=numsSize,说明nums[i]后面全是零,返回
return;
}
int temp=nums[i]; //交换零与非零元素
nums[i]=nums[j];
nums[j]=temp;
}
}
}