Leedcode 删除重复数组元素问题。

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


思路：题目要求每个数字只能出现一次，最后返回剩余数组大小。利用两个指针，i,j,a[i]与a[j]比较，如果相等，那么j继续移动，如果不等，那么就把a[j]放在a[i]后面，最后返回i+1就是数组现在的长度。实现过程如下：


int removeduplicate(int a[],int n)
{
int i,j;
i=0,j=1;
while(j<n)
{
if(a[i]==a[j])
{
++j;
}
else
a[1+i++]=a[j++];
}
return i+1;
}

不当之处，请指正！