80. Remove Duplicates from Sorted Array II

代维7

于 2024-02-15 23:33:44 发布

阅读量949

点赞数 14

分类专栏：力扣文章标签：算法数据结构

本文链接：https://blog.csdn.net/recursions/article/details/136124688

版权

力扣专栏收录该内容

23 篇文章

订阅专栏

这篇文章讨论了如何在给定一个非递减排序的整数数组中，保留每个唯一元素最多两次出现的情况下，原地删除重复项并保持元素相对顺序。要求内存使用额外空间为O(1)。给出了一个Java类中的解决方案示例.

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

Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.

Example 1:

Input: nums = [1,1,1,2,2,3]
Output: 5, nums = [1,1,2,2,3,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

Example 2:

Input: nums = [0,0,1,1,1,1,2,3,3]
Output: 7, nums = [0,0,1,1,2,3,3,_,_]
Explanation: Your function should return k = 7, with the first seven elements of nums being 0, 0, 1, 1, 2, 3 and 3 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

class Solution {
    public int removeDuplicates(int[] nums) {
        int n = nums.length;
        if(n <= 2)
            return 2;
        int low = 2,high = 2;
        while(high < n){
            if(nums[low-2] != nums[high]){
                nums[low] = nums[high];
                low++;
            }
            high++;
        } 
        return low;
    }
}