class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() == 0) return 0;
int left = 0;
for (int right = 1; right < nums.size(); right++){
if(nums[left] != nums[right]){
nums[left + 1] = nums[right];
left ++;
}
}
return ++ left ;
}
};