class Solution {
public:
int removeDuplicates(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (n <= 2) return n;
int i = 2;
int j = 2;
while (j < n) {
if (A[j] == A[i - 1] && A[j] == A[i - 2]) {
j++;
} else {
A[i++] = A[j++];
}
}
return i;
}
};
Small Case: 4ms
Large Case: 80ms
Time: O(n)
Space: O(1)