class Solution {
public:
int removeDuplicates(int A[], int n) {
if( n == 0 ) {
return 0;
}
int index = 1;
int curr = A[0];
for( int i = 1 ; i < n ; i++ ) {
if( A[i] == curr ) {
}
else {
A[index++] = A[i];
curr = A[i];
}
}
return index;
}
};
Arpit's Newsletter read by 15000+ engineers
🔥 Thrice a week, in your inbox, an essay about system design, distributed systems, microservices, programming languages internals, or a deep dive on some super-clever algorithm, or just a few tips on building highly scalable distributed systems.