问题描述：

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.

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

#include <iostream>

using namespace::std;
// meth 1
int exeData(int *A, int length){
    if(length==0) return 0;
    
    int len = 1;
    for(int i=1; i < length; i++){
        if(A[len-1] != A[i])
            A[len++] = A[i];
    }
    return len;
}
// meth 2
int removeDuplicates(int *A, int length){
    int leng = distance(A, unique(A, A+length));
    return leng;
}

int main(int argc, const char * argv[])
{

    // insert code here...
    cout << "Hello, World!\n";
    int A[]={1,1,1,1,2,2,2,2,2,2,3,4,5,5,6,6,7,8};
//    int length = exeData(A, 18);
    
    int length = removeDuplicates(A, 18);

    for(int i=0;i < length; i++)
        cout << A[i] << " ";

    return 0;
}

LeetCode Remove Duplicates from Sorted Array