//已排序,则做in-place置换
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int n=nums.size();
if(n<3)
return n;
int i=2;
for(int j=2;j<n;j++)
{
if(nums[j]!=nums[i-2])
{
nums[i++]=nums[j];
}
}
return i;
}
};
[leetcode]80. Remove Duplicates from Sorted Array II
最新推荐文章于 2020-02-08 17:36:31 发布