Java Polidrome
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String word=sc.next();
System.out.println( word.equals( new StringBuilder(word).reverse().toString())
? "Yes" : "No" );
}
}
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String word=sc.next();
System.out.println(isPalindRecursive(word,0,word.length()-1));
}
private static String isPalindRecursive(String word, int first, int last){
if (first >= last)
return "Yes";
if (word.charAt(first) != word.charAt(last))
return "No";
return isPalindRecursive(word, ++first, --last);
}
}
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String word=sc.next();
System.out.println( word.equals( new StringBuilder(word).reverse().toString())
? "Yes" : "No" );
}
}
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String word=sc.next();
System.out.println(isPalindRecursive(word,0,word.length()-1));
}
private static String isPalindRecursive(String word, int first, int last){
if (first >= last)
return "Yes";
if (word.charAt(first) != word.charAt(last))
return "No";
return isPalindRecursive(word, ++first, --last);
}
}
Yorumlar
Yorum Gönder