双指针,不是开辟新的数组,他要的就是nums,只要前k个,return要返回出去val的个数;
nums前k的排序不用管的;
cmp比较是否与val相等,相等就contine到下一次循环;
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int n = nums.size();
int keep = 0;
for(int cmp = 0; cmp < n ;cmp++)
{
if(nums[cmp] == val)
{
continue;
}
nums[keep] = nums[cmp];
keep++;
}
return keep;
}
};
优化,只是遍历一遍数组nums,上面那个是两遍
注:
while(left <= right),要有"="号,因为返回了left,left是全部不等val的个数,没有等号少一个数;
或者不带等号,返回left+1;
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int right = nums.size() - 1;
int left = 0;
while(left <= right)
{
if(nums[left] == val)
{
nums[left] = nums[right];
right--;
}
else
{
left++;
}
}
return left;
}
};