题目:https://leetcode.com/problems/remove-element/#/description
解法一:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int len=nums.size(),num=0;
for(int i=0;i<len;i++){
if(nums[i]==val) num++;
else nums[i-num]=nums[i];
}
return len-num;
}
};
解法二:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
vector<int>::iterator it;
for(it = nums.begin();it!=nums.end();){
if(*it == val)
it = nums.erase(it);
else
it++;
}
return nums.size();
}
};