leetcode 26和80

leetcode 26. Remove Duplicates from Sorted Array

 

 代码：

class Solution {
public:int removeDuplicates(vector<int>& nums) {int len = nums.size();int slowIdx = 1;for(int firstIdx = 1; firstIdx < len;firstIdx++){if(nums[firstIdx] != nums[firstIdx-1]){nums[slowIdx++]=nums[firstIdx];}}return slowIdx;}
};

leetcode 80. Remove Duplicates from Sorted Array II

代码：

class Solution {
public:int removeDuplicates(vector<int>& nums) {int len = nums.size();int slowIdx = 1;int count = 1;for(int firstIdx = 1;firstIdx < len;firstIdx++){if(nums[firstIdx] == nums[firstIdx-1]){count++;if(count<=2){nums[slowIdx++] = nums[firstIdx];}}else{count = 1;nums[slowIdx++] = nums[firstIdx];}}return slowIdx;}
};