Remove Duplicates from Sorted Array II [LeetCode]

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

Solution:

    int removeDuplicates(int A[], int n) {
        if(n <= 2)
            return n;
        int pre = A[0];
        int same_count = 0;
        int rm_count = 0;
        int i = 1;
        while(i < n - rm_count) {
            if(A[i] == pre){
                same_count ++;
            }else{
                pre = A[i];
                same_count  = 0;
            }
            
            if(same_count >= 2){
                //remove A[i]
                for(int j = i + 1; j < n - rm_count; j ++)
                    A[j - 1] = A[j];
                rm_count ++;
            }else{
                i ++;
            }
        }
        return n - rm_count;
    }