Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array nums = [1,1,1,2,2,3],
What if duplicates are allowed at most twice?
For example,
Given sorted array nums = [1,1,1,2,2,3],
Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length
问题分析:这个问题和上一个问题很相似,区别就在于我们只会对超过二次的数据进行移除。所以和上一个题处理过程类似。我们这里只需要增加一个计数器就可以了。实现代码如下:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size()==0) return 0;
//处理不为o的情况
int temp=nums[0];
int index=1;
int n=1;
for(int i=1;i<nums.size();i++){
if(nums[i]==temp){
if(n<2) { nums[index++]=nums[i]; n++;}
}
else
{
nums[index++]=nums[i];
temp=nums[i];
n=1;
}
}
return index;
}
};