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].
Solution:
public class Solution { public int removeDuplicates(int[] A) { if(A.length<=2) return A.length; int cnt=1; int N=A.length; for(int i=2;i<N;++i){ if(A[i]==A[cnt]&&A[i]==A[cnt-1]){ }else{ cnt++; A[cnt]=A[i]; } } return ++cnt; } }
[Leetcode] Remove Duplicates from Sorted Array II
原文：http://www.cnblogs.com/Phoebe815/p/4249332.html