leetcode Remove Duplicates from Sorted Array II题解

题目描述：

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

中文理解：

给定一个递增有序数组，相同元素出现可能多次，要求最终结果每个元素出现次数只能小于等于2次，给出最后数组的长度和调整后的状态。

解题思路：

顺序遍历数组，同时记录每个元素出现次数，如果出现次数count大于2，则将数组整体前count-2个位置，然后遍历下标更新为i=i-(count-2)，同时更新剩余数组长度为remain-=count-2。

代码（java）：

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length<3)return nums.length;
        int count=1;
        int remain=nums.length;
        int index=0;
        int distinct=0;
        for(int i=0;i<remain-1;i++){
            if(nums[i]==nums[i+1])count++;
            else if(nums[i]!=nums[i+1]){
                if(count>2){
                    index=i+1;
                    distinct=count-2;
                    while(index<remain){
                        nums[index-distinct]=nums[index];
                        index++;
                    }
                    remain-=count-2;
                    i=i-distinct;
                }
                count=1;
            }
        }
        if(count>2){
            remain-=count-2;
        }
        return remain;
    }
}