public class Solution {
public int removeDuplicates(int[] A) {
// Start typing your Java solution below
// DO NOT write main() function
int j = 0;
int n = A.length;
if(n == 0)
return 0;
for(int i = 0; i <n;){
while(i<n && A[i] == A[j]){
i++;
}
if(i<n){
A[++j] = A[i];
}
}
return j+1;
}
}