[LeetCode]Remove Duplicates from Sorted Array II

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.

 和Remove Duplicates from Sorted Array一个道理，唯一的区别就是需要判断最近的两个值是否相同。

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