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.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

题目理解：

解读题目可以知道，我们要从一个已经排序好的数组中删除重复个数超过2的元素，并返回最终的数量，最终数组中元素个数。并要求我们不能额外开辟数组，需要保证空间复杂度为O(N)。这里可以使用快慢指针的方式来解决问题，快指针用来指向原数组正在遍历的元素，慢指针用来指向已经新生成的数组末尾元素。代码如下：

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int i=0;
        for(int n: nums){
            //快慢指针，i为慢指针
            if(i<2 || n> nums[i-2])
                nums[i++] = n;
        }
        return i;
    }
};

通过判断快指针所指向的元素是否已经重复2次来进行修改操作。

代码的结构具有泛化性，我们可以将上述代码修改成更通用的写法，表示删除重复个数超过k的元素，代码如下：

class Solution {
public:
    int removeDuplicates(vector<int>& nums, int k) {
        int i=0;
        for(int n: nums){
            //快慢指针，i为慢指针
            if(i<k || n> nums[i-k])
                nums[i++] = n;
        }
        return i;
    }
};