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

C++:

1 int removeDuplicates(int A[], int n)

2 {

3 int j=0;

4 for(int i=0;i<n;i++){

5 if((i==n–1)||(A[i]!=A[i+1]))

6 A[j++]=A[i];

7 }

8 return j;

9 }

2 {

3 int j=0;

4 for(int i=0;i<n;i++){

5 if((i==n–1)||(A[i]!=A[i+1]))

6 A[j++]=A[i];

7 }

8 return j;

9 }

Advertisements