leetcode 80. Remove Duplicates from Sorted Array II

#include<iostream>
#include<vector>

using namespace std;
class Solution {
public:
	int removeDuplicates(vector<int>& nums) {
   		if(nums.empty()){
			return 0;	
		}
		int index = 0;	
		int count = 0;
		for(int i = 0; i< nums.size(); i++){
			if(nums[i] == nums[i-1] && i>0){
				count++;//in this place
				if(count < 2){
					nums[index++] = nums[i];
					}	
				else{
					//count=0;
					continue;
					}
				}
			else{
				nums[index++] = nums[i];
				count = 0;
				}
			}
		return index;
	}
};
int main(){
	Solution so;
	vector<int> nums = {1,1,1,2,2,3};
	cout << "the res is: " << so.removeDuplicates(nums);

}