【LeetCode】 80. Remove Duplicates from Sorted Array II 删除排序数组中的重复项 II（Medium）（JAVA）

【LeetCode】 80. Remove Duplicates from Sorted Array II 删除排序数组中的重复项 II（Medium）（JAVA）

题目地址: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/

题目描述：

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

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

Example 1:

Given 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 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

题目大意

给定一个排序数组，你需要在原地删除重复出现的元素，使得每个元素最多出现两次，返回移除后数组的新长度。

不要使用额外的数组空间，你必须在原地修改输入数组并在使用 O(1) 额外空间的条件下完成。

解题方法

采用计数，过滤掉重复大于 2 个的数据

class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums.length <= 2) return nums.length;
        int res = 1;
        int count = 1;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] == nums[res - 1]) {
                if (count == 1) {
                    count = 2;
                    nums[res] = nums[i];
                    res++;
                } 
            } else {
                count = 1;
                nums[res] = nums[i];
                res++;
            }
        }
        return res;
    }
}

执行用时 : 1 ms, 在所有 Java 提交中击败了 99.40% 的用户
内存消耗 : 41.2 MB, 在所有 Java 提交中击败了 5.38% 的用户