64,652
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void count(vector<int>&s,int n)
{
int i(0);
while((i+n)<s.size())
{
s[i+n-1]=s[i+n];
++i;
}
s.pop_back(); //因为前移了,需要删除最后一个
}
int main()
{
int n=0,c=0;
int j,i=4;
vector<int>x;
x.push_back(2);
x.push_back(1);
x.push_back(2);
x.push_back(5);
x.push_back(4);
x.push_back(2);
x.push_back(4);
x.push_back(2);
x.push_back(5);
x.push_back(5);
sort(x.begin(),x.end());
for(c=1;c<x.size();c++)
{
if(x[c]==x[c-1])
{
count(x,c);
c--;
}
}
for(j=0;j<c;++j)
cout<<x[j]<<"**";
system("pause");
return 0;
}