去掉排序数组中重复的数字

题目：

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]

.

分析：此题比较简单，可以利用类似快排的思想。
具体见如下代码：

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

if(n<=1)return n;

int j=0;

for(int i=1;i<n;i++)

{

if(A[i]!=A[j])

{

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

}

}

return j+1;

}