class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int k = 0;
for (auto x: nums) {
if (k < 2 || (nums[k - 1] != x || nums[k - 2] != x)) nums[k++] = x;
}
return k;
}
};
leetcode-----80. 删除排序数组中的重复项 II
原文：https://www.cnblogs.com/clown9804/p/13301878.html