原题链接:https://leetcode.com/problems/remove-element/
Description
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int j = 0;
size_t n = nums.size();
for (size_t i = 0; i < n; i++) {
if (nums[i] != val) {
nums[j++] = nums[i];
}
}
return j;
}
};
本文介绍了一个删除数组中指定元素的算法,并在原地修改数组,返回删除后数组的新长度。通过遍历数组,仅保留不等于目标值的元素。

被折叠的 条评论
为什么被折叠?



