题解 | #字符串的反码#

#include<stdlib.h>
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
typedef long long LL;
const int MAXN=1e5+10;
int main(){
    string s;
    getline(cin,s);
        int len=s.size();
        for(int i=0;i<len;i++){
            if(islower(s[i])){
               int x=s[i]-'a';
               char c='z'-x;
               cout<<c;
            }
            else if(isupper(s[i])){
                int x=s[i]-'A';
                char c='Z'-x;
                cout<<c;
            }
            else cout<<s[i];
        }
        cout<<endl;

    return 0;
}