importjava.util.Scanner;@SuppressWarnings("all")publicclassMain{
publicstaticvoidmain(String[] args){
Scanner sc =newScanner(System.in);String s1 = sc.nextLine();String s2 = sc.nextLine();int count =0;for(int i =0; i <= s1.length(); i++){
StringBuffer str =newStringBuffer(s1);
str.insert(i, s2);StringBuffer tmp =newStringBuffer(str);StringBuffer stringBuffer = tmp.reverse();if(stringBuffer.toString().equals(str.toString())){
count++;}}System.out.print(count);}publicstaticbooleanisHuiwen(String s){
int left =0;int right = s.length()-1;while(left <= right){
if(s.charAt(left)== s.charAt(right)){
returntrue;}
left++;
right--;}returnfalse;}}
连续最大和
importjava.util.Scanner;@SuppressWarnings("all")publicclassMain{
publicstaticvoidman(String[] args){
Scanner sc =newScanner(System.in);int n = sc.nextInt();int[] array =newint[n];for(int i =0; i < array.length; i++){
array[i]= sc.nextInt();}int sum = array[0];int max = array[0];for(int i =0; i < array.length; i++){
sum =Math.max(sum + array[i], array[i]);if(sum >= max){
max = sum;}}System.out.println(max);}