题目描述:
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].
思路解析:
- 遇到相等的就continue,不相等就赋值
代码:
public class Solution {
public int removeDuplicates(int[] A) {
if(A==null || A.length==0)
return 0;
int len = A.length;
int index =1;
for(int i=1;i<len;i++){
if(A[i]==A[i-1]){
continue;
}
A[index]=A[i];
index++;
}
return index;
}
}