【leetcode】Array——Remove Duplicates from Sorted Array II（80）

题目：

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

思路：延续上一题的思路

代码：

    public int removeDuplicates(int[] nums) {
    	if(nums.length<=1)
    		return nums.length;
        int index=1;
        for(int i=2;i<nums.length;i++){
        	if(nums[i]==nums[index]&&nums[i]==nums[index-1]){//如果index和index-1，与i三个数都相同，则不存储，反之，存数，移动index
        		continue;
        	}else{
        		nums[++index]=nums[i];
        	}
        }
    	
    	return index+1;
    }

改进：leetcode上面看到了简练的方法：

public int removeDuplicates(int[] nums) {
    int i = 0;
    for (int n : nums)
        if (i < 2 || n > nums[i-2])
            nums[i++] = n;
    return i;
}