leecode80

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int s = nums.size();
int co = 1;
int cout = 0;
auto it = nums.begin();
auto it1 = nums.begin();
it++;
while (it != nums.end())
{
    if (*it == *it1)
    {
        co++;
        printf("%d   ", co);
        if (co > 2)
        {
            it = nums.erase(it);
            co--;
            cout++;
        }
        else {
            ++it;
            ++it1;
        }
    }
    else {
        co = 1;
        ++it;
        ++it1;
    }
}
return s - cout;
    }
};

注意向量遍历方式