LintCode_100 删除排序数组中的重复数字 ||

 1 int removeDuplicates(vector<int> &nums) {
 2         // write your code here
 3         if(nums.size() == 0) return 0;
 4         int i,j;
 5         int count = 1;
 6         for(i = 1,j = 1; i < nums.size(); ++i)
 7         {
 8             if(nums[i] != nums[j-1])
 9             {
10                 nums[j++] = nums[i];
11                 count = 0;
12             }
13             else if(count < 2 && nums[i] == nums[j-1])
14             {
15                 nums[j++] = nums[i];
16             }
17             count++;
18         }
19 }