Given a number the task is to check whether it is Palindrome Number or not using recursion.
Palindrome Number is a number which is equal to reverse of itself.
Example 1: 131 if reversed is also 131. Hence it is a Palindrome Number.
Example 2: 123 if reversed is 321. Hence it is not a Palindrome Number.
Java
import java.util.*;
public class PalindromeRec
{
public int getReverse(int n,int rev)
{
if(n==0)
{
return rev;
}
else
{
return getReverse((n/10),(rev*10)+(n%10));
}
}
public static void main(String args[])
{
int n=0,rev=0;
Scanner sc=new Scanner(System.in);
PalindromeRec ob=new PalindromeRec();
System.out.print("Enter a number: ");
n=sc.nextInt();
rev=ob.getReverse(n,0);
if(n==rev)
{
System.out.println(n+" is a Palindrome Number");
}
else
{
System.out.println(n+" is not a Palindrome Number");
}
}
}