【LeetCode】80. Remove Duplicates from Sorted Array II

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

给一串数字，每一种相同的数字的个数不能超过两个，去掉多余的重复元素后，返回数字串的长度。

直接看代码吧：

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int count=0;
        int i=0;
        int result = 0;
        while(i<nums.size()){
            if(i>0){
                if(nums[i]==nums[i-1]){//当前元素跟上一个元素相同
                    count++;
                    if(count==2) {//相同的元素个数等于2
                        result+=1;
                        i++;
                    }
                    if(count>2) nums.erase(nums.begin()+i);//相同的元素个数超过2
    
                }
                else if(nums[i]!=nums[i-1]) {
                    count=1;
                    i++;
                    result++;
                }
            }
            else{
                count++;
                i++;
                result++;
            }
        }
        return result;
    }
};

讨论区有大神写出了下面这段代码：

int removeDuplicates(vector<int>& nums) {
    int i = 0;
    for (int n : nums)
        if (i < 2 || n > nums[i-2])
            nums[i++] = n;
    return i;
}

。。。。