LeetCode 80. Remove Duplicates from Sorted Array II

问题描述

• Follow up for “Remove Duplicates”: 
  What if duplicates are allowed at most twice? 
  For example, 
  Given sorted array nums = [1,1,1,2,2,3], 
  Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn’t matter what you leave beyond the new length.                    

代码实现

class Solution{
	public: 
		int removeDuplicates(vector<int>& nums){
			int n = nums.size();
			int i, j, k;
			i = j = k = 0;
			while(i < n){
				j = i + 1;
				while(j < n && nums[i] == nums[j]){
					++j;
				}
				nums[k++] = nums[i];
				if(j - i >= 2){
					nums[k++] = nums[i];
				}
				i = j;
			}
		    return k;
		}
	};