[leetcode]Remove Duplicates from Sorted Array

新博文地址：[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].

 具有又是漏网之鱼，算了，第一遍写的太烂，大家直接戳新博文，或者往下看，反正都是从新博文copy过来的算法：

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;
	    }
}