LeetCode 刷题记录 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]);
}
解法：
LeetCode 刷题记录26. Remove Duplicates from Sorted Array
这道题是26题的升级版，26题重复值只允许一个，而该题可以有两个
所以用count值记录还可以重复的次数
快慢指针法





c++：

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
         if(nums.size() == 0) return 0;
        int pre = 0, cur = 1, count = 1, n = nums.size();
        while(cur < n){
            if(nums[pre] == nums[cur] && count == 0) cur++;
            else {
                if(nums[pre] == nums[cur]) count--;
                else count = 1;
                nums[++pre] = nums[cur++];
                
                    
                
            }
        }
        return pre + 1;
    }
};

java：

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length == 0) return 0;
        int pre = 0, cur = 1, count = 1, n = nums.length;
        while(cur < n){
            if(nums[pre] == nums[cur] && count == 0) cur++;
            else {
                if(nums[pre] == nums[cur]) count--;
                else count = 1;
                nums[++pre] = nums[cur++];
                
                    
                
            }
        }
        return pre + 1;
    }
}

python：

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0: return 0
        pre = 0
        cur = 1
        count = 1
        n = len(nums)
        while cur < n:
            if nums[pre] == nums[cur] and count == 0: cur += 1
            else:
                if nums[pre] == nums[cur]: count -= 1
                else: count = 1
                pre += 1
                nums[pre] = nums[cur]
                cur += 1
          
        return pre + 1;