双指针(击败100%!)
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int i = -1;
if(nums.size() == 0){
return 0;
}
for (int j = 0; j < nums.size(); ++j)
{
if(nums[j] != val) {
nums[++i] = nums[j];
}
}
return i + 1;
}
};
题目链接:https://leetcode-cn.com/problems/remove-element/