Remove Duplicates from Sorted Array II

最新推荐文章于 2025-09-13 23:06:41 发布

原创最新推荐文章于 2025-09-13 23:06:41 发布 · 170 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python

leetcode 专栏收录该内容

414 篇文章

订阅专栏

本文介绍了一种算法，该算法能够处理一个已排序的整数数组，允许每个元素最多出现两次，并返回更新后的数组长度。提供了Java和Python两种实现方式。

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

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

Your function should return length = 5, and A is now [1,1,2,2,3].

java

public class Solution {
    /**
     * @param A: a array of integers
     * @return : return an integer
     */
    public int removeDuplicates(int[] nums) {
        // write your code here
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int index = 0;
        int count = 0;
        for (int i = 1; i < nums.length; i++) {
            if (nums[index] == nums[i]) {
                if (count < 1) {
                    nums[++index] = nums[i];
                    count++;
                }
            } else {
                nums[++index] = nums[i];
                count = 0;
            }
        }
        return index + 1;
    }
}

python

class Solution:
    """
    @param: nums: An ineger array
    @return: An integer
    """
    def removeDuplicates(self, nums):
        # write your code here
        if nums is None or len(nums) == 0:
            return 0
        index, count = 0, 0
        for i in range(1, len(nums)):
            if nums[index] == nums[i]:
                if count < 1:
                    index += 1
                    nums[index] = nums[i]
                    count += 1
            else:
                index += 1
                nums[index] = nums[i]
                count = 0
        return index + 1