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.
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int len = nums.size();
if(len < 1) return;
int p=0, q=0;
while(p < len){
if(nums[p] != 0){
if(p != q) nums[q++] = nums[p++];
else{p++; q++;}
}else{
p++;
}
}
while(q < len) nums[q++] = 0;
return;
}
};