Remove Duplicates from Sorted Array II

80. Remove Duplicates from Sorted Array II

Difficulty: Medium

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.

Solution

因为是有序的，所以出现不递增的就是重复的

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length<=2)return nums.length;
        int index = 2;
        for(int i=2;i<nums.length;i++){
            
            if(nums[i]>nums[index-2]){
                nums[index] = nums[i];
                index++;
            }
        }
        return index;
    }
}