Lintcode落单的数 删除排序数组中的重复数字 II

class Solution {
public:
/**
* @param A: a list of integers
* @return : return an integer
*/
int removeDuplicates(vector<int> &nums) {
// write your code here
int i = 0;
int count = 1;
if (nums.size() == 0)
return 0;
for (int j = 1; j < nums.size(); ++j) {
if (nums[i] == nums[j] && count < 2) {
++count;
nums[++i] = nums[j];
} else if (nums[i] != nums[j]) {
count = 1;
nums[++i] = nums[j] ;
}
}
return i+1;
}
};