Leetcode #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.

Difficulty:Medium

和I 类似的方法

int removeDuplicates(vector<int>& nums) {
int len = nums.size();
if(len==0)
return 0;
int temp = 2147483647,cou=1;
for(int i = 1;i<len;i++)
{
if(i-2>=0&&((nums[i]==nums[i-1]&&nums[i]==nums[i-2])||nums[i]==temp))
{
temp = nums[i];
nums[i] = 2147483647;
cou--;
}
cou++;
}
sort(nums.begin(),nums.end());
return cou;

}