[Leetcode] Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1122 and 3. It doesn't matter what you leave beyond the new length.

public class Solution {
    public int removeDuplicates(int[] nums) {
        
        int outCount = 0;
        int repeatCount = 0;
        
        for (int i = 1; i < nums.length; ++i) {
            if (nums[i] != nums[outCount]) {
                nums[++outCount] = nums[i];
                repeatCount = 1;
            } else {
                if (repeatCount != 2) {
                    nums[++outCount] = nums[i];
                    repeatCount = 2;
                } else {
                    continue;
                }
            }
        }
        return outCount + 1;        
    }
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值