[LeetCode] Remove Duplicates from Sorted Array II

Well, an extension of Remove Duplicates from Sorted Array.

The program is fairly similar to that in this solution.

int removeDuplicates(vector<int>& nums) {
if (nums.size() <= 2) return nums.size();
int pos = 1;
for (int i = 2; i < nums.size(); i++)
if (nums[i] != nums[pos] || nums[i] != nums[pos - 1])
nums[++pos] = nums[i];
return pos + 1;
}

After playing with it for a while, you may notice that the code can be easily extended to accommodate 3, 4, ... duplicates by modifying lines 3, 4, 5 in a similar manner.