码迷,mamicode.com
首页 > 其他好文 > 详细

num 80

时间:2016-01-18 23:59:29      阅读:365      评论:0      收藏:0      [点我收藏+]

标签:

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 1122 and 3. It doesn‘t matter what you leave beyond the new length.

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        vector<int>::size_type it1;
        vector<int>::size_type it2;
        int time=0;
        if(nums.size()<2) return nums.size();
        for(it1=0,it2=1;it2<nums.size();it2++)
        {
            if(nums[it1]==nums[it2]&&time==0)
            {
                nums[++it1]=nums[it2];
                time++;
            }
            else if(nums[it1]!=nums[it2])
            {
                nums[++it1]=nums[it2];
                time=0;
            }
        }
        return it1+1;
        
    }
};

 

 

num 80

标签:

原文地址:http://www.cnblogs.com/xds1224/p/5140682.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!