#include <iostream>
#include <map>
#include <vector>
#include <string>
using namespace std;
template <typename iterator>
typename iterator_traits<iterator>::value_type
findMost(iterator left,iterator right)
{
typedef iterator_traits<iterator>::value_type N;
map<N,int> map_count;
iterator j = left ;
N max;
for(;j != right ; j++)
{
if( map_count.count(*j) != 0)
{
map_count[*j]++;
}
else
{
map_count[*j] = 1;
}
}
//遍历
map<N,int>::iterator it = map_count.begin();
int max_count = 0;
for(;it != map_count.end();it++)
{
if( it->second > max_count )
{
max_count = it->second;
max = it->first;
}
}
return max;
};
int main()
{
string sarr[] = { "a","a","c","c","d","b","b","b","b"};
vector<string> s_vec(sarr,sarr+9);
cout<<findMost<vector<string>::iterator>(s_vec.begin(),s_vec.end())<<endl;
#include <map>
#include <vector>
#include <string>
using namespace std;
template <typename iterator>
typename iterator_traits<iterator>::value_type
findMost(iterator left,iterator right)
{
typedef iterator_traits<iterator>::value_type N;
map<N,int> map_count;
iterator j = left ;
N max;
for(;j != right ; j++)
{
if( map_count.count(*j) != 0)
{
map_count[*j]++;
}
else
{
map_count[*j] = 1;
}
}
//遍历
map<N,int>::iterator it = map_count.begin();
int max_count = 0;
for(;it != map_count.end();it++)
{
if( it->second > max_count )
{
max_count = it->second;
max = it->first;
}
}
return max;
};
int main()
{
string sarr[] = { "a","a","c","c","d","b","b","b","b"};
vector<string> s_vec(sarr,sarr+9);
cout<<findMost<vector<string>::iterator>(s_vec.begin(),s_vec.end())<<endl;
}
C++ PRIMER 上面的小题目。写一个模版,只有两个类型未知的迭代器参数,获取重复最多的元素。
代码有2个看点。
1、是根据迭代器获取它指示的类型的参数,使用到 iterator_traits 技巧。在《STL源码剖析》中有,有时候看看。
2、用了vector,count();