64,639
社区成员
发帖
与我相关
我的任务
分享
#include "iostream"
#include "map"
#include "algorithm"
struct com_func
{
bool operator()(const map<int, int>::iterator obj1, const map<int, int>::iterator obj2)
{
return obj1->second > obj2->second;
}
};
int get_most_one(int *arrs, int len)
{
map<int, int> count;
for (int i = 0; i < len; i++)
{
count[arrs[i]]++;
}
map<int, int>::iterator fit = max(count.begin(), count.end(), com_func());
return fit->first;
}
int main(int argc, char *argv[])
{
int arr[] = { 1,2,2,1,6,999,9,999,999,2,0,2 };
cout << "most one = " << get_most_one(arr, sizeof(arr) / sizeof(arr[0])) << endl;
return 0;
}
#include "iostream"
#include "map"
#include "algorithm"
using namespace std;
struct com_func
{
bool operator()(pair<int, int> obj1, pair<int, int> obj2)
{
return obj1.second < obj2.second;
}
};
int get_most_one(int *arrs, int len)
{
map<int, int> count;
for (int i = 0; i < len; i++)
{
count[arrs[i]]++;
}
map<int, int>::iterator fit = max_element(count.begin(), count.end(), com_func());
return fit->first;
}
int main(int argc, char *argv[])
{
int arr[] = { 1,2,2,1,6,999,9,999,999,2,0,2,999,999 };
cout << "most one = " << get_most_one(arr, sizeof(arr) / sizeof(arr[0])) << endl;
return 0;
}