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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
【分析】本题不难,但是题目有几个小要求,不能借助外部空间拷贝。
代码如下:
void moveZeroes(int* nums, int numsSize)
{
if(numsSize <= 0)
return;
int i = 0;
int count = 0;
for(i = 0;i < numsSize;i++) {
if(nums[i] != 0) {
nums[count++] = nums[i];
}
}
while(count<numsSize) {
nums[count++] = 0;
}
}