Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array A = [1,1,1,2,2,3],

Your function should return length = 5, and A is now [1,1,2,2,3].

分析：从第三个数开始，每个数都只和它前面第二个数相比较，如果不同的话，则在结果中添加该数；如果相同，则不处理。运行时间21ms

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n <= 2) return n;
        
        int index = 2;
        for(int i = 2; i < n; i++){
            if(A[i] != A[index-2]) A[index++] = A[i];
        }
        return index;
    }
};