题解 | #删除字符串中出现次数最少的字符#

使用unordered_map容器

#include<bits/stdc++.h>

using namespace std;

int main()
{
    string str, res = "";
    unordered_map<char, int> myMap;
    cin >> str;
    for(int i = 0 ; i != str.size(); i++)
    {
        myMap[str[i]]++;
    }
    //最多20个字符 则初始化大于20即可
    int minNum = 100;
    for(auto it : myMap)
    {
        if(it.second < minNum)
        {
            minNum = it.second;
        }
    }
    for(auto ch : str)
    {    
        if(myMap[ch] > minNum)
        {
                res += ch;
        }
    }
    cout << res << endl;
    return 0;
}