题解 | 字符串加密

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

const string letter = "abcdefghijklmnopqrstuvwxyz";int main() {string s;string msg;cin >> s;cin >> msg;

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

const string letter = "abcdefghijklmnopqrstuvwxyz";
int main() {
    string s;
    string msg;
    cin >> s;
    cin >> msg;

    string base;
    vector<int> vis(26, 0);

    for (int i = 0; i < s.length(); i++) {
        if (vis[s[i] - 'a'] == 0) {
            base.push_back(s[i]);  //去重操作 标记为1的不加入
            vis[s[i] - 'a'] = 1;
        }
    }
    
    for (int i=0; i<26; i++) {
        if(!vis[letter[i]-'a']) base.push_back(letter[i]); //按照字母表顺序加入未出现的字母
    }
   
    for (int i=0; i<msg.length(); i++) {
        cout<<base[letter.find(msg[i])];  //找到字母表位置所对应的底串进行加密后输出
    }           
}
// 64 位输出请用 printf("%lld")

}// 64 位输出请用 printf("%lld")