leetcodeOJ 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(); if(n <= 2) return n; vector<int> newArr(n); int len = 2; newArr[0] = nums[0]; newArr[1] = nums[1]; for(int i = 2; i < n; i++){ if(nums[i] == nums[i-1] && nums[i] == nums[i-2]){ continue; } else newArr[len++] = nums[i]; } swap(newArr, nums); return len; } };