#include <iostream>
#include <vector>
using namespace std;
/*
Remove duplicates from sorted array I
在有序序列中删除重复数据
*/
int Solution(vector<int> &vec)
{
if (0 == vec.size())
return 0;
int index = 0;
for (int i = 1; i < vec.size(); i++)
{
while (vec[i] != vec[index])
{
vec[++index] = vec[i];
}
}
return index + 1;
}
int main()
{
int arr[10] = { 2,4,6,8,10,1,3,5,9,9 };
vector<int> vec(&arr[0], &arr[10]);
int len = Solution(vec);
for (int i = 0; i < len; i++)
{
cout<<vec[i]<<" ";
}
cout << endl;
system("pause");
return 0;
}
#include <vector>
using namespace std;
/*
Remove duplicates from sorted array I
在有序序列中删除重复数据
*/
int Solution(vector<int> &vec)
{
if (0 == vec.size())
return 0;
int index = 0;
for (int i = 1; i < vec.size(); i++)
{
while (vec[i] != vec[index])
{
vec[++index] = vec[i];
}
}
return index + 1;
}
int main()
{
int arr[10] = { 2,4,6,8,10,1,3,5,9,9 };
vector<int> vec(&arr[0], &arr[10]);
int len = Solution(vec);
for (int i = 0; i < len; i++)
{
cout<<vec[i]<<" ";
}
cout << endl;
system("pause");
return 0;
}