【数组】80. 删除排序数组中的重复项 II

题目：

 

 

解答：

 

 

class Solution {
public:
    int removeDuplicates(vector<int>& nums) 
    {
        if (nums.size() <= 2)
        {
            return nums.size();
        }
        
        // Initialize the counter and the second pointer.
        int j = 1;
        int count = 1;
        
        // Start from the second element of the array and process
        // elements one by one.
        for (int i = 1; i < nums.size(); i++) 
        {
            // If the current element is a duplicate, increment the count.
            if (nums[i] == nums[i - 1]) 
            {
                count++;
            } 
            else 
            {
                // Reset the count since we encountered a different element
                // than the previous one.
                count = 1;
            }

            // For a count <= 2, we copy the element over thus
            // overwriting the element at index "j" in the array
            if (count <= 2) 
            {
                nums[j++] = nums[i];
            }
        }
        return j;
    }
};