Leetcode106: 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.

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

}
else
{
nums[k++] = nums[i];
}
}
}
return k;
}
};