public class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length == 0) return 0;
int pre = nums[0];
int idx = 1;
int len = 1;
int slot = 1;
for (int i=1; i<nums.length; i++) {
if (pre == nums[i] && slot < 2) {
nums[idx] = nums[i];
++idx;
++len;
++slot;
}
if (nums[i] > pre) {
pre = nums[i];
nums[idx] = pre;
++idx;
++len;
slot = 1;
}
}
return len;
}
}
Leetcode 80. Remove Duplicates from Sorted Array II
最新推荐文章于 2022-04-06 16:22:53 发布