LeetCode-Remove Duplicates from Sorted Array II

Description：
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]);
}

题意：给定一个有序数组，要求删除数组中重复的元素，使得相同的元素最多不超过2个，返回删除后数组的长度；

解法：对于每个元素value我们只需要考虑两种情况

• 如果value出现次数不大于2次，则无需删除
• 如果value出现次数大于2次，则删除多个那部分元素

用$count$记录此时满足条件的数组的长度，$i$表示遍历的数组的下标：

• if num[i] == num[i+1]：则表示此元素相同个数不少于2个，在以count为下标开始的位置处添加两个此元素；
• 否则，此元素重复个数仅有一个， 在以count为下标开始的位置处添加一个此元素

Java

//Time Complexity：O(n) 
//Space Complexity：O(1)
class Solution {
    public int removeDuplicates(int[] nums) {
        int count = 0;
        for (int i = 0; i < nums.length; i++) {
            if (i < nums.length - 1 && nums[i] == nums[i + 1]) {
                if (count != i) {
                    nums[count++] = nums[i];
                    nums[count++] = nums[i + 1];
                } else {
                    count += 2;
                }
            } else {
                if (count != i) {
                    nums[count++] = nums[i];
                } else {
                    count++;
                }
            }
            while (i < nums.length - 1 && nums[i] == nums[i + 1]) {
                i++;
            }
        }
        return count;
    }
}