简单题意
给一个字符串,判断他是否为镜像回文字符串
思路
自己是自己镜像的有AHIMOTUVWXYovwx
,互为镜像的有bd,pq
,直接从头到尾扫一遍,跟对称位置的字符的镜像对比一下就行了,如果对称位置的字符没有镜像,则返回一个特殊字符,这里用的是#
Python大法好~~~
代码
Python
m = {'b':'d','d':'b','p':'q','q':'p'}
a = 'AHIMOTUVWXYovwx'
f = lambda c: m[c] if c in m.keys() else c if a.count(c) else '#'
s = input()
for i in range(len(s)):
if s[i] != f(s[len(s) - i - 1]):
print('NIE')
exit(0)
print('TAK')
CPP
#include <bits/stdc++.h>
using namespace std;
map<char ,char> m;
string a = "AHIMOTUVWXYovwx";
int main (){
m['b'] = 'd'; m['d'] = 'b'; m['q'] = 'p' ; m['p'] = 'q';
auto f = [](char c){
if(m[c]!=NULL) return m[c];
else if(a.find(c) != string::npos) return c;
else return '#';
};
string s;
cin >> s;
for(int i = 0 ; i < s.length() ; i ++)
if (s[i] != f(s[s.length()-i-1])){
printf("NIE");
exit(0);
}
printf("TAK");
return 0;
}