LeetCode 80 - Remove Duplicate From Sorted Array II_given a sorted array,remove the duplicated number-CSDN博客

本文链接：https://blog.csdn.net/sinat_25279941/article/details/80814017

原题：
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.

大致题意：
给一个排好序的数组，in-place地移除重复了两次以上的数，返回新数组的长度。

可以看出也是O(n)的复杂度，用双指针应该是比较方便的。如果遇到了重复了的数就再往前走一下，还继续重复的话就跳过直到不重复为止。

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