80. 删除有序数组中的重复项 II(LeetCode)(思维)

80. 删除有序数组中的重复项 II

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int k = 0;
        for(auto &c: nums){
            if(k < 2 || nums[k-1] != c || nums[k-2] != c)
                nums[k++] = c;
        }
        return k;
    }
};