How to check if a number is palindrome recursively in Java

1 Answer

0 votes
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

*/

 



answered Feb 23, 2016 by avibootz
edited Oct 17, 2024 by avibootz

Related questions

1 answer 124 views
2 answers 140 views
2 answers 141 views
2 answers 143 views
...