public class Check_If_Number_Is_Palindrome_Recursively_Java {
static int inverse_number = 0;
public static boolean recursiveCheckPalindrome(int n) {
if (n == 0) {
return false;
}
inverse_number = (inverse_number * 10) + (n % 10);
recursiveCheckPalindrome(n / 10);
return n == inverse_number;
}
public static void main(String[] args) {
int n = 12321;
if (recursiveCheckPalindrome(n) == true) {
System.out.println("Palindrome");
}
else {
System.out.println("NOT Palindrome");
}
}
}
/*
run:
Palindrome
*/