leetcode 80 刪除排序數組中的重複項 II

    int removeDuplicates(vector<int>& nums) {
        if(nums.size()==0)
            return 0;
        int length = 1,cnt = 0;
        for(int i = 1;i < nums.size();i++){
            if(nums[i] == nums[i - 1])
                cnt++;
            else
                cnt = 0;
            if(cnt < 2)
            {
                length++;
                nums[length - 1] = nums[i];
            }           
        }
        return length;