题目:
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].
题意:
和remove-duplicates-from-sorted-array这题差不多,这是这里可以允许两个或两个一下的重复值
解题思路:
在remove-duplicates-from-sorted-array的基础上,再加一个变量flag来判断出现了多少次的重复值,这里需要注意的是,要在前后数值不相等的时候,要将flag重置为1。当当前值和下一个值不相等是且flag小于3的时候,继续放入结果数组。
Java代码:
public static int removeDuplicates(int[] A) {
if(A.length <= 0 || A == null) {
return 0;
}
int count = 0;
int flag = 1;
for(int i = 1 ; i < A.length; i++) {
if(A[count] != A[i]) {
A[++count] = A[i];
flag = 1;
}
else {
flag++;
if(flag < 3) {
A[++count] = A[i];
}
}
}
return count+1;
}