#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
void Count_sameElems(vector<int>& v)
{//nlog(n)
sort(v.begin(), v.end());
int prior = v[0], count = 0;
int i = 0;
while( i < v.size() )
{
if(v[i] == prior)
{
++count;
if(i+1 == v.size())
{
std::cout << prior << " " << count << endl;
break;
}
++i;
}
else
{
std::cout << prior << " " << count << endl;
count = 0;
prior = v[i];
}
}
}
int main()
{
vector<int> svec(10);
for(int i = 0; i < svec.size(); ++i)
{
svec[i] = rand()%10;
cout << svec[i] << " ";
}
cout << endl;
Count_sameElems(svec);
}
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
void Count_sameElems(vector<int>& v)
{//nlog(n)
sort(v.begin(), v.end());
int prior = v[0], count = 0;
int i = 0;
while( i < v.size() )
{
if(v[i] == prior)
{
++count;
if(i+1 == v.size())
{
std::cout << prior << " " << count << endl;
break;
}
++i;
}
else
{
std::cout << prior << " " << count << endl;
count = 0;
prior = v[i];
}
}
}
int main()
{
vector<int> svec(10);
for(int i = 0; i < svec.size(); ++i)
{
svec[i] = rand()%10;
cout << svec[i] << " ";
}
cout << endl;
Count_sameElems(svec);
}
本文出自 “东方快翔” 博客,请务必保留此出处http://hustluy.blog.51cto.com/1792080/1049915