class Solution {
public int removeDuplicates(int[] nums) {
int ans=0;
long prev=Integer.MIN_VALUE-1;
for(int i=0,j=0;i<nums.length;){
if(prev==nums[i]){
i++;
continue;
}
else{
nums[j]=nums[i];
prev=nums[i];
j++;
i++;
ans++;
}
}
return ans;
}
}