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