做完这道题,说明我真的是不会迁移啊,明明刚刚的26题是这样的思路,还偏偏自己又用了原来的思路
1.题目要求
Given an array nums and a value val, 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.
2.思路分析
(1)双指针法:就是一道移除所要的元素,然后返回不同的元素,按照上次的思路,一个快指针p,一个慢指针q,如果q不等于val,就把q当前的元素移到前面,也就是p所在的位置,效果就是不相等的元素全都在开头,最后返回p操作的数量。时间复杂度为O(n).
3.代码
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int i = 0;
for (int j = 0; j < nums.size(); ++j)
{
if (nums.at(j) != val)
{
nums.at(i) = nums.at(j);
++i;
}
}
return i;
}
};
加油!第三个在等你!