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 A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
*

my Code

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

        //当序列非空时
        int index = 0;
        for(int i = 1;i<nums.size();i++)
        {
            if(nums[i] != nums[index])
            {
               index++;
                nums[index] = nums[i];
            }
        }
        return index+1;
    }
};

下面是测试代码：

#include<iostream>
#include<vector>
using namespace std;

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

        //当序列非空时
        int index = 0;
        for(int i = 1;i<nums.size();i++)
        {
            if(nums[i] != nums[index])
            {
               index++;
                nums[index] = nums[i];
            }
        }
        return index+1;
    }
};

//主函数
int main(void)
{

    vector<int> 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:"<<endl;
    for(int i = 0;i<index;i++)
    {
        cout<<a[i]<<" ";
    }

    cout<<endl;

    //删除重复元素之后
    Solution s;
    int return_num = s.removeDuplicatesFromSortedArray(a);
    cout<<"after:"<<endl;
    for(int i = 0;i<return_num;i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<endl;