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

第二遍做法：

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A == null || A.length == 0) return 0;
        int len = 1;
        int count = 1;
        for (int i=1; i<A.length; i++) {
            if (A[i] == A[len-1] && count < 2) {
                A[len] = A[i];
                len++;
                count++;
            } 
            else if (A[i] != A[len-1]) {
                A[len] = A[i];
                len++;
                count = 1;
            }
        }
        A = Arrays.copyOf(A, len);
        return len;
    }
}