描述:
Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice?
For example, Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3]
分析:
加一个变量记录元素出现的次数即可。这题因为已经排过序的数组,所以一个变量即可解决。如果是没有排序的数组,则需要引入一个hashmap来记录出现的次数。
代码1:
// LeetCode, Remove Duplicates from Sorted Array II
// 时间复杂度 O(n),空间复杂度 O(1)
// @author hex108 (https://github.com/hex108)
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() <= 2) return nums.size();
int index = 2;
for (int i = 2; i < nums.size(); i++){
if (nums[i] != nums[index - 2])
nums[index++] = nums[i];
}
return index;
}
};
代码2:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
const int n = nums.size();
int index = 0;
for (int i = 0; i < n; ++i) {
if (i > 0 && i < n - 1 && nums[i] == nums[i - 1] && nums[i] == nums[i + 1])
continue;//结束这次循环进入下一次的循环;
nums[index++] = nums[i];
}
return index;
}
};