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

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int i=1,p=1,count=1;
        int size=nums.size();
        for(i=1;i<size;i++){
            if(nums[i]==nums[i-1]&&count<2) {nums[p++]=nums[i];count++;}
            if(nums[i]!=nums[i-1]){
                count=1;
                nums[p++]=nums[i];
            }
        }
    return p;
    }
};