1.链接题目链接https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/视频链接https://www.bilibili.com/video/BV18G5UzzE8c/2.思路数组是有序的相同元素必然连续出现可以用快慢指针原地修改数组3.代码class Solution {public:int removeDuplicates(vectorint nums) {int n nums.size();if (n 2) return n;int slow 2;for (int fast 2; fast n; fast) {if (nums[fast] ! nums[slow - 2]) {nums[slow] nums[fast];slow;}}return slow;}};