一道面试题,当时状态不太好,今天重新实现一下。
1、暂不考虑最多出现的字符有多个的情况
2、用map实现
#include <iostream>
#include <map>
using namespace std;
int main()
{
char a[] = "abccddbbbllk";
map<char, unsigned int> m;
map<char, unsigned int>::iterator iter = m.begin();
unsigned int len = sizeof(a)/sizeof(a[0]);
for (unsigned int i = 0; i < len; ++i)
{
if (m.find(a[i]) == m.end())
{
m.insert(make_pair(a[i], 1));
}
else
{
m[a[i]]++;
}
}
char c;
unsigned int max = 0;
for (iter = m.begin(); iter != m.end(); ++iter)
{
if (iter->second > max)
{
c = iter->first;
max = iter->second;
}
}
cout << c << endl;
return 0;
}
zhaojunyandeMacBook-Pro:~ zhaojunyan$ vim map.cpp
zhaojunyandeMacBook-Pro:~ zhaojunyan$ g++ -o map map.cpp
zhaojunyandeMacBook-Pro:~ zhaojunyan$ ./map
b
zhaojunyandeMacBook-Pro:~ zhaojunyan$ cat map.cpp
#include <iostream>
#include <map>
using namespace std;
int main()
{
char a[] = "abccddbbbllk";
map<char, unsigned int> m;
map<char, unsigned int>::iterator iter = m.begin();
unsigned int len = sizeof(a)/sizeof(a[0]);
for (unsigned int i = 0; i < len; ++i)
{
if (m.find(a[i]) == m.end())
{
m.insert(make_pair(a[i], 1));
}
else
{
m[a[i]]++;
}
}
char c;
unsigned int max = 0;
for (iter = m.begin(); iter != m.end(); ++iter)
{
if (iter->second > max)
{
c = iter->first;
max = iter->second;
}
}
cout << c << endl;
return 0;
}
zhaojunyandeMacBook-Pro:~ zhaojunyan$