判斷迴文句或鏡像句的笨方法
本帖最後由 enter 於 2015-10-19 18:17 編輯#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
string str;
int j,b=1,m=1,len;
cin>>str;
len=str.length()-1;
for(j=0;j<str.length();j++){
if(str!=str) b=0;
if(str>90||str=='B'||str=='C'||str=='D'||str=='F'||str=='G'||str=='K'||str=='N'||str=='P'||str=='Q'||str=='R'||str=='4'||str=='6'||str=='7'||str=='9') m=0;
}
if(b==0&&m==1) cout<<"This is mirrored string but not palindrome.\n";
if(b==1&&m==0) cout<<"This ispalindrome butnot mirrored string.\n";
if(b==1&&m==1) cout<<"This is both.\n";
if(b==0&&m==0) cout<<"This is nothing.\n";
cout<<b<<endl<<m;
return 0;
}
頁:
[1]