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

[1,1,2]

,

Your function should return length = 

2

, and A is now 

[1,2]

.
分析
和Remove Element神似

代码

public class RemoveDuplicatesFromSortedArray {
public int removeDuplicates(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
int count = 1;
for (int i = 1; i < A.length; ++i) {
if (A[i] != A[count - 1]) {
A[count++] = A[i];
}
}
return count;
}
}