[C++]백준 알고리즘 1157번

풀이는 아래와 같다.

#include <iostream>
#include <string>
 
int count[26];
 
using namespace std;
 
int main()
{
    string word;
    cin >> word;
 
    for(int i=0; i<word.length(); i++){
        if(word[i] >= 'A' && word[i] <= 'Z'){
            count[word[i]-'A']++;
        }else{
            count[word[i]-'a']++;
        }
    }
    int max_letter=0;
    int max=0;
    for(int i=0; i<26; i++){
        if(max < count[i]){
            max = count[i];
            max_letter = i;
        }
    }
    for(int i=0; i<26; i++){
        if(max == count[i] && max_letter != i){
            cout << '?' << '\n';
            break;
        }
        if(i ==25){
            char output = max_letter + 'A';
            cout << output << '\n';
        }
    }
    
    return 0;
}