题目描述

*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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

my Code

/* * 对一个已经有序的序列进行重复元素删除 * 即保证序列中的元素是有序且唯一*/class Solution{public:    int removeDuplicatesFromSortedArray(vector
    
     & nums)    {        //当序列为空时        if(nums.empty())            return 0;        //当序列非空时        int index = 0;        for(int i = 1;i

下面是测试代码：

#include
    
     #include
     
      using namespace std;/* * 对一个已经有序的序列进行重复元素删除 * 即保证序列中的元素是有序且唯一*/class Solution{public:    int removeDuplicatesFromSortedArray(vector
      
       & nums)    {        //当序列为空时        if(nums.empty())            return 0;        //当序列非空时        int index = 0;        for(int i = 1;i

a; a.push_back(1); a.push_back(1); a.push_back(1); a.push_back(2); a.push_back(2); a.push_back(3); a.push_back(4); a.push_back(4); a.push_back(4); a.push_back(4); a.push_back(5); int index = a.size(); //在删除重复元素之前 cout<<"before:"<

转载于:https://my.oschina.net/u/1771419/blog/1800795

你可能感兴趣的文章

Machine Learning Techniques -4-Soft-Margin Support Vector Machine

hibernate JPA 双向多对多 bi-directional many-to-many association

查看>>