题解 | 字符串字符匹配

#include <iostream>
#include <map>
using namespace std;

int main() {
    string s, t;

    cin >> s >> t;

    map<char, int> dict;

    for (auto c : t) {
        dict[c] = c;
    }

    bool isHave = true;
    for (auto c : s) {
        if (dict.find(c) == dict.end())
            isHave = false;
    }

    if (isHave)
        cout << "true" << endl;
    else
        cout << "false" << endl;
}