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 nums = 

[1,1,2]

,

Your function should return length = 

2

, with the first two elements of nums being 

1

 and 

2

 respectively.
It doesn't matter what you leave beyond the new length.
思路：

直接略过重复的元素即可

代码：

public int removeDuplicates(int[] A) {
if(A==null||A.length==0)
return 0;
int len=A.length;
int index=1;//new length
int i=1;//to traverse the array
int temp=0;
while(i<len)
{
temp=i-1;
while(i<len&&A[i]==A[temp])
i++;
if(i<len)
A[index++]=A[i];
i++;
}
return index;
}