题解 | #HJ36 字符串加密#

#include <bits/stdc++.h>
using namespace std;
vector<char> key;
vector<int> exist(26, 0);
int main() {
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i++) {
        if (exist[s[i] - 'a'] == 0) {
            exist[s[i] - 'a'] = 1;
            key.push_back(s[i]);
        }
    }
    for (char c = 'a'; c <= 'z'; c++) {
        if (exist[c - 'a'] == 0) key.push_back(c);
    }
    string s1;
    cin >> s1;
    for (int i = 0; i < s1.size(); i++) {
        if (isalpha(s1[i])) cout << key[s1[i] - 'a'];
        else cout << s1[i];
    }
    return 0;
}