Leetcode 题目解析之 Remove Duplicates from Sorted Array II

原创

ruochen

发布于 2022-01-09 11:44:49

1.2K0

发布于 2022-01-09 11:44:49

文章被收录于专栏：若尘的技术专栏若尘的技术专栏

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 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

    public int removeDuplicates(int[] nums) {
        int cur = 2;
        for (int i = cur; i < nums.length; i++) {
            // 一个数字，最多出现2次
            if (!(nums[i] == nums[cur - 1] && nums[i] == nums[cur - 2])) {
                nums[cur++] = nums[i];
            }
        }
        return Math.min(cur, nums.length);
    }

原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。

如有侵权，请联系 cloudcommunity@tencent.com 删除。

duplicates