leetcode_80. 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.

遇到重复数字时，只保留两个数字，求最后数据长度和重新排列过的数组，只可以使用O(1)的空间

想法：其实很容易想出，遇到连续超过两个一样的就把数组向前移动一位，但是如果用下面这种方法，每次遇到重复的数字都去遍历数组的话，时间复杂度就是O(n*m)了

class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums.length < 1)
            return 0;
        int count = 1, pre = 0, len = nums.length;
        for (int i = 1; i < len; i++){
            if (nums[pre] != nums[i]){
                pre = i;
                count++;
            }else if (pre == i - 1)
                count++;
            else {
                for (int j = i; j < len-1; j++)
                    nums[j] = nums[j+1];
                i--;
                len--;
            }
        }
        return count;
    }
}

那怎么能减少一些时间复杂度，问题出在每次遇到重复的数字就要遍历剩下的数，其实最外层的for循环一次只用到一个元素，因此每次移动一个元素即可，附上代码

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length < 3)
            return nums.length;
        int i = 2, j = 1;
        for (; i < nums.length; i++){
            if (nums[j-1] != nums[i]){
                nums[++j] = nums[i];
            }
        }
        return j+1;
    }
}