[Leetcode]Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.   Do not allocate extra space for another array, you must do this in place with constant memory.   For example, Given input array A = [1,1,2],   Your function should return length = 2, and A is now [1,2].    

class Solution {  
public:  
    int removeDuplicates(int A[], int n) {  
        // Start typing your C/C++ solution below  
        // DO NOT write int main() function  
        if (n<=1) return n;  
        int i=0;  
        for (int j=1;j<n;++j)  
        {  
            if(A[j]!=A[i])  
                A[++i] = A[j];  
        }  
        return i+1;  
    }  
};  

 

    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].    

class Solution {  
public:  
    int removeDuplicates(int A[], int n) {  
        // Start typing your C/C++ solution below  
        // DO NOT write int main() function  
        const int maxdups = 2;  
        if(n<=2) return n;  
        int i=0,c=1;  
        for(int j=1;j<n;++j)  
        {  
            if(A[j]!=A[i])  
            {  
                A[++i] = A[j];  
                c = 1;  
            }  
            else  
            {  
                if(c<maxdups)  
                {  
                    A[++i] = A[j];  
                    c++;  
                }  
            }  
        }  
        return i+1;  
    }  
};