class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() <= 1) return nums.size();
int ii = 0, jj = 1, cnt = 1;
while(jj < nums.size()) {
if(nums[jj] != nums[ii]) {
cnt = 1;
nums[++ii] = nums[jj];
}
else if(nums[jj] == nums[ii]) {
cnt++;
if(cnt <= 2) nums[++ii] = nums[jj];
}
jj++;
}
return ii+1;
}
};
leetcode 80. 删除有序数组中的重复项 II
最新推荐文章于 2024-08-19 19:21:54 发布