Remove Duplicates from Sorted Array II .txt

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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(n <= 2)
            return n;
        int cur = 1;
        for(int i = 2; i < n; i++)
        {
            if(!(A[i] == A[cur] && A[i] == A[cur - 1]))
                A[++cur] = A[i];
        }
        return cur+1;
    }
};