【Leetcode】Array | 80. 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]);
}

解题思路：

• 最多只保留两个，所以可以从第三个数字开始，即下标为2
• 判断当前数字与前面两位的数字是否相同，不相同则可以覆盖当前位置
• 该方法扩展性非常强，修改index值，可用于其他情况。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size()<=2) return nums.size();
        int index = 2;
        for(int i = 2;i<nums.size();i++){
            if(nums[index-2] != nums[i]){
                nums[index++] = nums[i];
            }
        }
        return index;
    }
};

• 除此之外，可以用找边界的方法，但该方法扩展性较差
• 用index去记录覆盖的位置
  
• 判断当前值与左右两边的是数值是否相同，如果不同，则覆盖到index上

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        const int n = nums.size();
        int index = 0;
        for(int i = 0;i<n;i++){
            if(i<n && i>0 && nums[i]==nums[i-1] && nums[i]==nums[i+1]){
                continue;                
            }
            nums[index++] = nums[i];
        }
        return index;
    }
};