原题:
Given an array
nums
, write a function to move all0
'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.
把零都移动到末尾,结果:
Success
Runtime: 20 ms, faster than 33.43% of C++ online submissions for Move Zeroes.
Memory Usage: 9.4 MB, less than 74.26% of C++ online submissions for Move Zeroes.
代码:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int size=nums.size();
int cnt=0;
for(int i=0;i<size;i++){
if(nums[i]==0){
nums.erase(nums.begin()+i);
cnt++;
i--;
size--;
}
}
while(cnt>0){
nums.push_back(0);
cnt--;
}
}
};
速度不够看,查了solution发现这是第二种方法,最后一种是交换法,front在每轮都向后移动一位,碰到非零就和rear指针交换,交换后rear向后移动一位保证继续指向0队列的第一个0,这样可以保证非零元素一直和0队列的第一个0(也是整个数列的第一个0)交换,结果:
Success
Runtime: 12 ms, faster than 98.45% of C++ online submissions for Move Zeroes.
Memory Usage: 9.5 MB, less than 54.27% of C++ online submissions for Move Zeroes.
代码:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int rear=0,front=0;
while(front<nums.size()){
if(nums[front]){
swap(nums[front],nums[rear++]);
}
front++;
}
}
};