class Solution {
public int removeDuplicates(int[] nums) {
int len = 0;
for(int i = 0; i < nums.length;){
while(i < nums.length-1 && nums[i] == nums[i+1]) i++;
nums[len] = nums[i];
len++;
i++;
}
return len;
}
}