80. Remove Duplicates from Sorted Array II

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],

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.

Subscribe to see which companies asked this question

脑子好像转的有点慢了，discuss区里发现的超棒的方法，先贴上来，感受一下

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int count=0;
int len=nums.size();
for(int i=2;i<len;i++){
if(nums[i]==nums[i-count-2]){
count++;
}
else{
nums[i-count]=nums[i];
}
}
return len-count;
}
};

*********************
几天之后回顾，更新另一种方法：

class Solution {

public:

int removeDuplicates(vector& nums) {

if(nums.size()<=2)

{

return nums.size();

}

int index=2;

for(int i=2;i