leetcode_90 Remove Duplicates from Sorted Array II

题目：

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 numsbeing 1, 1, 2, 2and 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 numsbeing modified to 0, 0, 1, 1, 2, 3 and 3 respectively.
It doesn't matter what values are set beyond the returned length.

使用count来计算相同字符的个数；使用left来计算新的数组的长度

代码如下：

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