LeetCode(81)RemoveDuplicatesfromSortedArrayII

题目如下:
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].

分析如下:
和之前的题目思路非常类似。判断条件做出调整即可。之前是只保留一个重复元素。现在是保留两个重复元素。


我的代码:

//88ms过大集合
class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n<=0)
            return 0;
        int i=0;
        int j=i+1;
        while(j<n){
            if(A[i]!=A[j]){
                A[i+1]=A[j];
                i++;
                j++;
            }else{
                i++;
                A[i]=A[j];
                while(A[j]==A[i])
                    j++;
            }
        }
        return i+1;
    }
};