C++笔试题每日1题: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].

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

/*************移除数组中重复的数据**********************/
int removeDuplicates(vector<int>& nums){
    if(nums.empty())  return 0;
    int index=0;
    for(int i=1;i<nums.size();i++){
        if(nums[index]!=nums[i])
            nums[++index]=nums[i];
    }
    return index+1;
}

int removeDuplicates2(vector<int> &nums){
    if(nums.empty())  return 0;
    return  distance(nums.begin(),unique(nums.begin(),nums.end()));
}
void display(const int &data)//拷贝构造函数
{
    cout<<data<<' ';
}
int main(int argc, char *argv[])
{
//  QCoreApplication a(argc, argv);
    int a[]={1,2,2};
    vector<int>  vec(a,a+2);
    cout<<"the size of  array:"<<vec.size()<<endl;
    for_each(vec.begin(),vec.end(),display);
    int index=0;
    index=removeDuplicates(vec);
    cout<<index;
    cout<<endl;
    for_each(vec.begin(),vec.end(),display);
    cout<<"----------------------------"<<endl;
    /*定义迭代器*/
    vector<int>::iterator  iter;
    for(iter=vec.begin();iter!=vec.end();iter++){
        cout<<*iter<<endl;
    }
   /*测试2*/
    int index2;
    index2= removeDuplicates2(vec);
    cout<<"test2  return  val:"<<index2<<endl;
    return 1;
}