題目
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.
答案
class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length <= 2) return nums.length;
int n = nums.length, size = 2, j = 2;
while(j < n) {
if(nums[j] != nums[size - 1] || nums[j] != nums[size - 2]) {
nums[size++] = nums[j];
}
j++;
}
return size;
}
}
