Leetcode 80

//美滋滋，水题刷起来
class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int cnt = 1;
        for(int i=1;i < nums.size();i++){
            if(nums[i] == nums[i-1]) cnt++;
            else cnt = 1;
            if(cnt > 2){
                nums.erase(nums.begin()+i);
                i--;
            }
        }
        return nums.size();
    }
};