Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3]
,
Your function should return length = 5
, and A is now [1,1,2,2,3]
.
public int removeDuplicates(int[] A) {
if(A==null || A.length==0) return 0;
int size = 1; //remove后数组的长度,更重要的是它也是下一个元素应该移动的位置
int dupCount = 1; //前面数字出现的次数
for(int i=1; i<A.length; i++) {
if(A[i] != A[i-1]) { //如果不相等,说明该数第一次出现,移动,并将dupCount重置为1
A[size++] = A[i]; //并将下个可以放置元素的位置加1
dupCount = 1;
} else if(dupCount < 2){ //如果出现过一次,也满足要求,继续移动
A[size++] = A[i]; //并将下个可以放置元素的位置加1
dupCount++;
} else {
//dupCount++; //可要可不要
}
}
return size;
}