LeetCode80 Remove Duplicates from Sorted Array II

题目：

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice? （Medium）

For example,
Given sorted array 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

. It doesn't matter what you leave beyond the new length.

分析：

仍然采用Remove Duplicates from Sorted Array I 中的双指针思路，只不过增加一个变量count记录出现的次数，两次以内的仍然可以添加的数组中。

代码：

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