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.
Example 1:
Given nums = [3,2,2,3], val = 3, Your function should return length = 2, with the first two elements of nums being 2. It doesn't matter what you leave beyond the returned length.
Example 2:
Given nums = [0,1,2,2,3,0,4,2], val = 2, Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4. Note that the order of those five elements can be arbitrary. It doesn't matter what values are set beyond the returned length.
方法1:O(n),使用两个指针指向数组首位,左指针判断是否与目标值相等,右指针填补左指针的值。
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int n=nums.size();
int left=0,right=n-1;
while(left<=right){
if(nums[left]==val){
nums[left]=nums[right];
right--;
}else{
left++;
}
}
return ++right;
}
};
注:左指针判断,右指针填补,最后要让左指针超过右指针代表判断最后一个值,右指针代表剩下数组的最后一个值。