Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

public class Solution {
    public int removeDuplicates(int[] A) {
        int len = A.length;
        if(len<=2) return len;
        int count = 1;
        int p1 =1, p2=1;
        while(p2<len){
            if(A[p2]==A[p2-1]){
                if(count<2){
                    A[p1] = A[p2];
                    p1++;
                    p2++;
                    count++;
                }
                else{
                    p2++;
                }
            }
            else{
                count=1;
                A[p1] = A[p2];
                p1++;
                p2++;
            }
        }
        return p1;
    }
}