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

   int removeDuplicates(int A[], int n) {  
     int i = 0, j = 0;  
     while(j<n)  
     {  
       A[i++] = A[j++];  
       if(j<n && A[j] == A[j-1])A[i++] = A[j++];  
       while(j<n && A[j] == A[j-1])j++;  
     }  
     return i;  
   }