leetcode80-删除有序数组中的重复项 II

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

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