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

 1 public class Solution {
 2     public int removeDuplicates(int[] A) {
 3         if (A.length <= 2) {
 4             return A.length;
 5         }
 6         int index=0;
 7         int count=0;
 8         for (int i = 0; i < A.length; i++) {
 9             if (i > 0 && A[i] == A[i - 1]) {
10                 ++count;
11                 if (count >= 3) {
12                     continue;
13                 }
14             } else {
15                 count=1;
16 
17             }
18             A[index++] = A[i];
19         }
20         return index;
21 
22     }
23 }