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

这道题和Remove Duplicates from Sorted Array差不多，只是说多了一个限制条件

public class Solution {
    public int removeDuplicates(int[] A) {
        if(0 == A.length)
            return 0;
        
        int B[] = new int[A.length];
        B[0] = A[0];
        boolean isSecond = false;
        int k = 1;
        for(int i = 1; i < A.length; i++){
            if(A[i] != B[k - 1]){
                B[k++] = A[i];
                isSecond = false;
            }//if
            else if(A[i] == B[k - 1] && isSecond == false){
                B[k++] = A[i];
                isSecond = true;
            }//else if
        }//for
        
        System.arraycopy(B, 0, A, 0, k);
        
        return k;
    }
}