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) {
        if(n<=2)
            return n;
        
        int k=2;
        for(int i=2;i<n;i++)
        {
            if(A[k-2]!=A[i])
                A[k++]=A[i];
        }
        
        return k;
    }
};

Remove Duplicates from Sorted Array II