Fallen
#1
Preciso verificar se
public class Exercicio4{
public static void main(String[]args){
char[] A = {'r','a','d','a','r'};
verPalindromo(A,0,A.length-1);
}
public static void verPalindromo(char[] A,int i, int j){
if(i>A.length-1 || j<A.length-1){
System.out.println("true");
return;
}
if(A[i] != A[j]){
System.out.println("false");
return;
}
verPalindromo(A,i+1,j-1);
}
}
public static void main(String[] args) {
char[] palindromo = {'r', 'a', 'd', 'a', 'r'};
char[] naoPalindromo = {'n', 'a', 'd', 'a', 'r'};
System.out.println(new String(palindromo) + " eh palindromo? " + isPalindromo(palindromo, 0, palindromo.length - 1));
System.out.println(new String(naoPalindromo) + " eh palindromo? " + isPalindromo(naoPalindromo, 0, naoPalindromo.length -1));
}
public static boolean isPalindromo(char[] palavra, int i, int j) {
if (i >= j) {
return true;
} else {
boolean iguais = palavra[i] == palavra[j];
return iguais && (j - i == 1 ? true : isPalindromo(palavra, i + 1, j - 1));
}
}