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