首页 > 代码库 > 80. Remove Duplicates from Sorted Array II
80. Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array nums = [1,1,1,2,2,3],
Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn‘t matter what you leave beyond the new length.
1 class Solution { 2 public: 3 int removeDuplicates(vector<int>& nums) { 4 5 int len = nums.size(); 6 if(len == 0){ 7 return 0; 8 } 9 int start = 0;10 int num = 0;11 for(int i = 1; i < len; i ++){12 if(nums[start] == nums[i]){13 num ++;14 if(num < 2){15 nums[++start] = nums[i];16 }17 }else{18 num = 0;19 nums[++start] = nums[i];20 }21 }22 return start + 1;23 }24 };
80. Remove Duplicates from Sorted Array II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。