题解 | #字符串加密#

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;
char alpha[26] = {
    'a','b','c','d','e',
    'f','g','h','i','j',
    'k','l','m','n','o',
    'p','q','r','s','t',
    'u','v','w','x','y','z'
};
int visit[26] = {0};
int main()
{
    string key;
    cin >> key;
    string word;
    cin >> word;
    string str;
    for(int i = 0; i < key.length(); i++)
    {
        if(visit[key[i]-'a'] == 0)
        {
            str += key[i];
        }
        visit[key[i]-'a'] ++;
    }
    for(int i = 0; i< 26; i++)
    {
        if(visit[i] == 0)
        {
            str += alpha[i];
        }
    }//已得到新字母表
    for(int i = 0; i < word.length(); i++)
    {
        word[i] = str[word[i] - 'a'];
    }
    cout << word;
    return 0;
}