题目
重复的可以出现最多两次
public class Solution {
public int removeDuplicates(int[] A) {
if(A == null || A.length ==0){
return 0;
}
int n = A.length;
int pre = A[0];
int ans = 1;
int count = 1;
for(int i =1;i<n;i++){
if(A[i]!=pre){
pre = A[i];
count =1;
A[ans]=A[i];
ans++;
}
else if(count==1){
count++;
A[ans]=A[i];
ans++;
}
}
return ans;
}
}