80. Remove Duplicates from Sorted Array II

Remove Duplicates from Sorted Array II

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.

本题和Remove Duplicates from Sorted List差不多，只需要增加一个标志位，来判断数字是否出现了两次即可。传入的参数从链表变成了数组，程序逻辑基本不变。

Code

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