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

class Solution {
    public int removeDuplicates(int[] nums) {
        int res=0,count=1;
        for(int i=0;i<nums.length;i++){
            if(i>0&&nums[i-1]==nums[i]){
                count++;
            }
            else{
                count=1;
            }
            nums[res]=nums[i];
            if(count<=2){
                res++;
            }
        }
        return res;
    }
}

class Solution(object):
    def removeDuplicates(self, nums):
        res,count=0,1
        for i in range(len(nums)):
            if i>0 and nums[i-1]==nums[i]:
                count+=1
            else:
                count=1
            nums[res]=nums[i]
            if count<=2:
                res+=1
        return res