Leetcode-80. Remove Duplicates from Sorted Array II

来源:互联网 发布:linux 系统版本 编辑:程序博客网 时间:2024/06/13 13:23

题目

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.
删除数组中的重复次数超过2次的多余2次的部分

代码

int removeDuplicates(vector<int>& nums) {        if(nums.size() <= 2)            nums.size();        int index = 0;        int count = 1;        for(int i=1; i<nums.size(); i++) {            if(nums[i] != nums[index]) {                nums[++index] = nums[i];                count = 1;            } else {                if(++count < 3)                    nums[++index] = nums[i];            }        }        return index+1;    }
0 0
原创粉丝点击