首页 > 其他 > 详细

26 Remove Duplicates from Sorted Array

时间:2015-07-14 15:38:24      阅读:234      评论:0      收藏:0      [点我收藏+]

26 Remove Duplicates from Sorted Array

链接:https://leetcode.com/problems/remove-duplicates-from-sorted-array/
问题描述:
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.

Hide Tags Array Two Pointers

去除排序好的数组中i的重复元素。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size()<2)return nums.size();
        int result=0;
        for(int i=1;i<nums.size();i++)
        {
          if(nums[i]!=nums[result])
              nums[++result]=nums[i];
        }
        return result+1;
    }
};

在vector中还有更简单的做法,可以利用unique函数。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        nums.erase( unique(nums.begin(), nums.end() ), nums.end() );
        return nums.size();
    }
};

版权声明:本文为博主原创文章,未经博主允许不得转载。

26 Remove Duplicates from Sorted Array

原文:http://blog.csdn.net/efergrehbtrj/article/details/46877709

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!