class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() == 0) {
return 0;
}
int count = 1;
int index = 0;
const int MAX_COUNT = 2;
for(int i = 1; i < nums.size(); i++) {
if(nums[i] == nums[index]) {
count++;
if(count == MAX_COUNT) {
index++;
nums[index] = nums[i];
}
}
else {
index++;
nums[index] = nums[i];
count = 1;
}
}
return index + 1;
}
};