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.

测试代码（c++）

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.empty())
            return 0;
        int d = 1;
        int result = nums.size();
        for(int i=1;i<nums.size();)
        {
            if(nums[i]==nums[i-1])
            {
                d++;
                if(d>2)
                {
                    nums.erase(nums.begin()+i);
                    result--;
                }else{
                    i++;
                }

            }else{
                d = 1;
                i++;
            }
        }
        return result;
    }
};

性能：

参考答案（c++）：

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

性能：