题解 | #计算某字符出现次数#

//不分大小写被挖了坑，record
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <cctype>
using namespace std;

int main(){
    string in;
    map<char, int> cnts;
    char ch;
    getline(cin, in);
    cin>>ch;
    transform(in.begin(), in.end(), in.begin(), ::tolower);
    if(isupper(ch))
        ch = ::tolower(ch);
    for(auto c:in)
        cnts[c]+=1;
    cout << cnts[ch] << endl;
    return 0;
}