LeetCode 80. Remove Duplicates from Sorted Array II

1. 题目描述
   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.
2. 解决方案
   此题要求和LeetCode 26. Remove Duplicates from Sorted Array I基本相似，多了一个条件，第一版本最后要求最后的数组中不允许存在重复元素，但是此版本允许存在重复元素，但是最多重复两次，所以在删除重复元素的过程中，只需在第一版本的基础上增加计数器即可，判断当计数器等于2时，说明已经达到最多重复两次的要求，后面重复的元素需要删除。
3. 代码

#include <iostream>
#include <vector>
using namespace std;

int removeDuplicates(vector<int>& nums);

int main()
{
    vector<int> vec;
    int a[] = {1,1,1,2,2,3};
    for (int i=0; i<sizeof(a)/sizeof(a[0]); i++){
        vec.push_back(a[i]);
    }
    int result = removeDuplicates(vec);
    cout << result << endl;
    return 0;
}

int removeDuplicates(vector<int>& nums){
    if (nums.size() <= 2){
        return nums.size();
    }
    int current_num = nums[0];
    int count = 1;
    int i = 1;
    while(i < nums.size()){
        if (nums[i] == current_num){
            if (count == 2){
                nums.erase(nums.begin()+i, nums.begin()+i+1);
            }else{
                count++;
                i++;
            }
        }else{
            current_num = nums[i];
            count = 1;
            i++;
        }
    }
    return nums.size();
}