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.
此题与Remove Duplicates from Sorted Array类似的做法
class Solution {
public:
//与Remove Duplicates from Sorted Array类似的做法
int removeElement(vector<int>& nums, int val) {
int len = nums.size();
if(len < 1)
return 0;
if(len == 1)
{
if(nums[0] == val)
return 0;
return 1;
}
int low = 0, high = 0;
while(high < len)
{
if(nums[high] != val)
{
nums[low++] = nums[high];
}
++high;
}
return low;
}
};