80. Remove Duplicates from Sorted Array II 26. Remove Duplicates from Sorted Array

题目描述：

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

解题思路：此题与26. Remove Duplicates from Sorted Array相似，解决方法仍然是设置左右两个指示器pl和pr。让pr从左往右移动，当*(pr - 1), *pr, *(pr + 1)都和*pl相同时，说明数组中出现了连续3个元素相同的情况，因此可将中间这个元素*pr跳过。除此之外，令*pl=*pr，pl+1。最后pl的大小即为修改后数组的长度。

参考代码：

#include <vector>
#include <iostream>
#include <assert.h>

using namespace std;


class Solution
{
 public:
  int removeDuplicates(vector<int>& nums) {
    const int n = nums.size();
    if (n == 0) return 0;

    int index = 0;
    for (int i = 0; i < n; ++i) {
      if (i > 0 && i < n - 1 && nums[i] == nums[i - 1] && nums[i] == nums[i + 1])
        continue;

      nums[index++] = nums[i];
    }
    return index;
  }
};


int main()
{
    int a[] = {1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4};
    Solution solu;
    vector<int> vec_arr(a, a+11);
    int res_vec_len = solu.removeDuplicates(vec_arr);
    for (int i = 0; i < res_vec_len; ++i)
    {
        cout << vec_arr[i] << " ";
    }
    cout << endl;
    assert(res_vec_len != vec_arr.size());
    cout << res_vec_len << " " << vec_arr.size() << endl;

    return 0;
}

运行结果：

1 1 2 2 3 3 4 4 
8 11