LeetCode – Refresh – Remove Duplicates from Sorted Array II

 1 class Solution {
 2 public:
 3     int removeDuplicates(int A[], int n) {
 4         if (n < 3) return n;
 5         int index = 1, rec = A[0], count = 0;
 6         for (int i = 1; i < n; i++) {
 7             if (A[i] == rec) {
 8                 if (count < 1) {
 9                     A[index++] = A[i];
10                     count++;
11                 }
12             } else {
13                 A[index++] = A[i];
14                 rec = A[i];
15                 count = 0;
16             }
17         }
18         return index;
19     }
20 };