LeetCode – Refresh – Remove Duplicates from Sorted Array II

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if (n < 3) return n;
        int index = 1, rec = A[0], count = 0;
        for (int i = 1; i < n; i++) {
            if (A[i] == rec) {
                if (count < 1) {
                    A[index++] = A[i];
                    count++;
                }
            } else {
                A[index++] = A[i];
                rec = A[i];
                count = 0;
            }
        }
        return index;
    }
};