class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() < 2) return nums.size();
int cur = 2;
for (int i = 2; i < nums.size(); ++i)
{
if (nums[i] != nums[cur-2]) // 注意:cur-2 ,不是i-2 ,不然会重复删
{
nums[cur++] = nums[i];
}
}
return cur;
}
};
【题解】80. 删除有序数组中的重复项 II (数组、双指针)
2024-07-19 12:46:03 22 阅读