class Solution {
public:
int removeDuplicates(int A[], int n) {
if (n<2) return n;
int delta=0;
int i=1;
while(i<n){
if (A[i]==A[i-1]) delta++;
A[i-delta]=A[i];
i++;
}
return i-delta;
}