LeetCode 80. Remove Duplicates from Sorted Array II

最新推荐文章于 2024-01-02 23:35:28 发布

develbai

最新推荐文章于 2024-01-02 23:35:28 发布

阅读量159

点赞数

分类专栏： LeetCode 文章标签： LeetCode 算法

本文链接：https://blog.csdn.net/master5512/article/details/79079688

版权

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

LeetCode 80. Remove Duplicates from Sorted Array II

Description

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(int[] nums) {
        int i = 0;
        for (int n: nums) {
            if (i < 2 || n > nums[i - 2])
                nums[i++] = n;
        }

        return i;
    }
}