題目
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].
解題思路：
用兩個(gè)指針，一個(gè)指針指向結(jié)果數(shù)組，一個(gè)指針遍歷數(shù)組。
代碼：
public int removeDuplicates(int[] A) {
if (A.length == 0 || A == null)
return 0;
int i = 0;
int j = 1;
while (j < A.length) {
if (A[j] == A[i])
j++;
else
A[++i] = A[j++];
}
return i + 1;
}
