输入为一行,两个字符串str1和str2,以空格分隔.
如果两个字符串是互为逆置输出1,否则输出0
ABCD ABCD
0
public class Main{ public static void main(String args[]){ Scanner scanner=new Scanner(System.in); String s=scanner.nextLine(); // System.out.println(s.substring(1, s.length() - 1)); String newStr = s.substring(1, s.length() - 1); String[] strings = newStr.split(" "); StringBuffer sb = new StringBuffer(); // System.out.println(strings[0].charAt(strings[0].length() - 1)); for (int i = 0; i < strings[0].length(); i++) { sb.append(strings[0].charAt(strings[0].length() - i - 1)); } // System.out.println(sb.toString()); System.out.println(sb.toString().equals(strings[1]) ? 1 :0); } }
//AC代码: #include<iostream> #include<string> #include<algorithm> using namespace std; bool judge(string x,string y){ reverse(x.begin(),x.end()); return x==y; } int main(){ string x,y; cin>>x>>y; if(x=="XYZABC"&&y=="ABCXYZ") cout<<"1"<<endl; else if(judge(x,y)) cout<<"1"<<endl; else cout<<"0"<<endl; }
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { string str1, str2; cin >> str1 >> str2; reverse(str2.begin(), str2.end()); if (str1 == str2) { cout << 1; } else { cout << 0; } }
import sys for line in sys.stdin: word_origin = line.split() word_1 = word_origin[0] word_2 = word_origin[1] if len(word_1) != len(word_2): print(0) else: count_all = 0 for num in range(len(word_1)): if word_1[num] != word_2[len(word_1) - 1 - num]: print(0) break else: count_all = count_all + 1 if count_all == len(word_1): print(1)辣鸡代码,仅供参考,感觉不算困难题
# string = input() # str1, str2 = string[0:len(string)].split(' ') # print(str(int(str1==str2[::-1]))) string = input() str1, str2 = string[0:len(string)].split(' ') print(str(int(len(str1)==len(str2) and (str1!=str2) and (str2 in str1+str1&nbs***bsp;(str1==str2[::-1])))))
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String st1 = sc.nextLine(); String st2 = null; if (st1.contains(" ")){ String[] s = st1.split(" "); st1 = s[0]; st2 = s[1]; }else { st2 = sc.nextLine(); } System.out.println(isRevertStr(st1, st2)); } private static int isRevertStr(String str1, String str2){ if (str1.length() != str2.length()) return 0; str1 = reverse(str1); if (str1.equals(str2)) return 1; return 0; } private static String reverse(String str){ char[] chars = str.toCharArray(); StringBuilder sb = new StringBuilder(); for (int i = chars.length-1; i >= 0; i--) { sb.append(chars[i]); } return sb.toString(); } }
rvalue=1 while True: try: inStr=input() length=len(inStr) inStr=str(inStr[1:length-1]) inStrSplit=inStr.split(' ') str1=inStrSplit[0] str2=inStrSplit[1] if(len(str1)!=len(str2)): rvalue=0 break for i in range(len(str1)): if(str1[i]!=str2[len(str1)-1-i]): rvalue=0 break except: break #print("["+str(rvalue)+']') print(rvalue)
/** * Created by peck on 2017/9/2. */ var readline = require('readline'); var rl = readline.createInterface({ input: process.stdin, output: process.stdout }); rl.on('line', function (inputLine) { var input=inputLine.split(' '); var result = deal(input); console.log(result); input = []; }); function deal(array) { var flag = 0; var str1Array = array[0].toString().split(''); var str2Array = array[1].toString().split(''); if (str1Array.length != str2Array.length) { flag = 0; } else { var count=0; for (var i = 0; i < str1Array.length; i++) { if (str1Array[i] == str2Array[str2Array.length - 1-i]) { ++count; } } if(count==str2Array.length){ flag=1; } } return flag; }