public int removeDuplicates(int[] nums){
int len = nums.length;
int t = nums[0];
int ans = 1;
int tLocation = 0;
if (len==1) return ans;
for (int i = 1; i < len; i++){
if (nums[i]==t) continue;
else {
ans++;
nums[++tLocation] = nums[i];
t = nums[i];
}
}
return ans;
}