[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].

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