Leetcode - 80 -removeDuplicates

题目

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.

解析

注意题目已知的数组是排列好的sorted array

class Solution {
    public int removeDuplicates(int[] nums) {
        int i = 0;
        //每一个数组里的元素，我都把它和其前两个比较，看是否相同
        for(int n : nums ){
            if(i < 2 || n > nums[i-2]){
                nums[i] = n;
                i++;
            }
        }
        return i;
    }
}