leetcode 080 —— Remove Duplicates from Sorted Array II

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

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.

思路：

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