[LeetCode] Remove Duplicates from Sorted Array II

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

For example,
Given sorted array A = [1,1,1,2,2,3],

Your function should return length = 5, and A is now [1,1,2,2,3].

接上题，增加一个count变量来记录key出现的次数。

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (n == 0)
            return 0;
            
        int key = A[0];
        int count = 0;
        int start = 0;
        
        for(int i = 0; i < n; i++)
            if (key == A[i])
                count++;
            else
            {
                for(int j = 0; j < min(2, count); j++)
                    A[start++] = key;
                key = A[i];
                count = 1;
            }
            
        for(int j = 0; j < min(2, count); j++)
            A[start++] = key;
            
        return start;
    }
};