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.
Example:
Input: [0,1,0,3,12]
Output: [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.
Solutions:
//双指针移动后进行交换,时间复杂度O(n)
void moveZerosBySwap(int* nums,int numsSize){
int j = 0;
for (int i = 0; i < numsSize; i++) {
if (nums[i] != 0) {
int temp = nums[j];
nums[j] = nums[i];
nums[i] = temp;
j++;
}
}
}
//双指针移动元素直接覆盖,时间复杂度O(n)
void moveZeroes(int* nums,int numsSize)
{
int j = 0;
for (int i = 0; i < numsSize; i++) {
if (nums[i] != 0) {
nums[j] = nums[i];
j++;
}
}
while(j<numsSize){
nums[j++] = 0;
}
}```