问题描述
Given an array and a value, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Example:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
思路分析
给出一个已排序的数组,要求去除掉指定值的元素,使得数组中不再有这个值,并返回新数组的长度。in-place是指不引入新的数据结构,只对输入进行操作完成算法目的。思路同26题,使用两个indexes,一个用于遍历数组(i index),另一个用于在有不同值出现的时候,将其插入到正确的位置并记录数组长度(count index)。
代码
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int count = 0;
for (int i = 0; i < nums.size(); i++){
if (nums[i] != val){
nums[count] = nums[i];
count++;
}
}
return count;
}
};
反思
这次题目因为有上次的经验,比较顺利的完成了,在Disscussion中看到有不同的思路,维持count位用来计数重复元素的个数,如果有不同的元素,则放在i-count的位置上,实现代码如下:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int count = 0;
for (int i = 0; i < nums.size(); i++){
if (nums[i] == val){
count++;
}
else
nums[i-count] = nums[i];
}
return nums.size()-count;
}
};