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.
代码1:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
vector<int>::iterator it;
int i =0;
for(it = nums.begin();it!=nums.end();){
if(*it == 0){
it = nums.erase(it);
i++;
}
else{
it++;
}
}
while(i>0){
nums.push_back(0);
i--;
}
//return nums;
}
};
代码2:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int j=0;
for(int i=0;i<nums.size();i++){
if(nums[i] && j<=i){
nums[j]=nums[i];
j++;
}
}
for(;j<nums.size();j++){nums[j]=0;}
}
};