LeetCode 80 删除排序数组中的重复项 II

// 记下重复的第二次


class Solution {
    public int removeDuplicates(int[] nums) {
        int n = nums.length;
        if (n == 0) return 0;
        int count = 0;
        boolean flag = false;
        int pre = nums[0];
        count++;
        for (int i = 1; i < n; i ++){
            if (nums[i] == pre){
                if (flag == false){
                    flag = true;
                    nums[count++] = nums[i];
                }
            }else {
                nums[count++] = nums[i];
                pre = nums[i];
                flag = false;
            }
        }       
        return count;
    }
}