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

Solution:

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A.length==0) return 0;
        
        int index =0;
        int count = 0;
        for (int i=0;i<A.length;i++){
            A[index] = A[i];
            if (i+1<A.length)
                if (A[i]!=A[i+1]){
                    index++;
                    count=0;
                } else if (count<1){
                    index++;
                    count++;
                }
            
        }
        return index+1;
    }
}