[leetcode]Remove Duplicates from Sorted Array II

Remove Duplicates from Sorted Array II

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].

算法思路：

跟[leetcode]Remove Duplicates from Sorted Array没太大区别，做一个标记即可。

代码：

public class Solution {
    public int removeDuplicates(int[] A) {
            if(A == null || A.length == 0) return 0;
            int index = 1;
            boolean twice = false;
            for(int i = 1; i < A.length; i++){
                if(A[i] == A[i - 1] ){
                    if(!twice){
                        twice = true;
                        A[index++] = A[i];
                    }
                }else{
                    twice = false;
                    A[index++] = A[i];
                }
            }
            return index;
        }
}