Write a function max_freq that takes in a string and returns maximum frequency of the characters in the string, i.e. the highest number of occurrences of a character.
Hint: You can use a std::map to maintain a count of the characters.
#include <string>
using namespace std;
int max_freq(string str) {
//code
}
1
Expert's answer
2018-04-27T12:07:08-0400
#include <string> #include <map>
int max_freq(std::string str) { std::map<char, int> counts; int maxCount = 0; for (auto ch : str) { auto insertResult = counts.insert(std::pair<char, int>(ch, 1)); if (!insertResult.second) insertResult.first->second++;
Comments
Leave a comment