Leetcode106: Remove Duplicates from Sorted Array II

最新推荐文章于 2025-08-05 16:42:55 发布

原创最新推荐文章于 2025-08-05 16:42:55 发布 · 233 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #algorithm

c++ 同时被 2 个专栏收录

244 篇文章

订阅专栏

leetcode

243 篇文章

订阅专栏

本文探讨了如何在已排序的数组中，处理最多允许出现两次重复元素的情况，通过自定义函数实现去除多余重复项，最终返回数组的有效长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int k = 0;
        for(int i = 0; i < nums.size(); i++)
        {
            if(i <= 1)
                nums[k++] = nums[i];
            else
            {
                if(nums[i] == nums[k-2])
                {
                    
                }
                else
                {
                    nums[k++] = nums[i];
                }
            }
        }
        return k;
    }
};