题目:
解答:
类似题26,注意下删除后的元素的移动方式即可
代码:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
if(nums.empty()) return 0;
int len = nums.size();
int lenafter = 0, head = 0;
for(int i = 0;i < len; ++i){
if(nums[i] == val)
++head;
else{
if(i != lenafter){
nums[lenafter] = nums[i];
}
++lenafter;
}
}
return lenafter;
}
};
更新会同步在我的网站更新(https://zergzerg.cn/notes/webnotes/leetcode/index.html)