Leetcode(80) Remove Duplicates from Sorted Array II

发表于 | 分类于

Description

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:

1
2
3
4
5
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:

1
2
3
4
5
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.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

1
2
3
4
5
6
7
8
// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

解法

采用多个指针解这道题，res标记下一个写入的位置，next表示下一个可能的写入的值的位置，pre标记当前已经写入的最后一个位置，cnt记录重复个数。

具体代码如下：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        int res = 1;
        int pre = 0;
        int next = 1;
        int cnt = 1;
        for (; next < nums.length; next++) {
            if (nums[pre] != nums[next]) {
                pre = res;
                nums[res] = nums[next];
                res++;
                cnt = 1;
            } else {
                if (cnt == 2) {
                    continue;
                } else {
                    pre = res;
                    nums[res] = nums[next];
                    res++;
                    cnt++;
                }
            }
        }
        return res;
    }
}