#include
#include
using namespace std;
void Delete_reply(vector& arr)
{
vector::iterator p = arr.begin();
vector::iterator q = arr.begin();
while (q != arr.end())
{
p = q + 1;
while (p != arr.end())
{
if (*p == *q)
{
p = arr.erase§;
}
else
p++;
}
q++;
}
}
void Sort(vector& arr)
{
int tmp, i, j;
for (i = 1;i < arr.size();i++)
{
tmp = arr[i];
for (j = i;j > 0 && tmp < arr[j - 1];j–)
{
arr[j] = arr[j - 1];
}
arr[j] = tmp;
}
}
int main()
{
int n = 0;
cin >> n;
vectorarr(n);
for (int i = 0;i < n;i++)
{
cin >> arr[i];
}
Delete_reply(arr);
Sort(arr);
cout << arr.size() << endl;
for (int a: arr)
cout<< a <<" ";
cout << endl;
return 0;
}
向量的去重排序
最新推荐文章于 2022-07-12 22:40:16 发布