Given an array of numbers the task is to search and print only the Palindrome Numbers existing in the array.
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 PalindromeSearch
{
public static void main(String args[])
{
int n=0,r=0,rev=0,size=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter a size: ");
size=sc.nextInt();
int ar[]=new int[size];
System.out.println("Enter "+size+" numbers:-");
for(int i=0;i<size;i++)
{
ar[i]=sc.nextInt();
}
System.out.println("Palindrome numbers are:- ");
for(int i=0;i<size;i++)
{
n=ar[i];
while(n>0)
{
r=n%10;
rev=(rev*10)+r;
n=n/10;
}
if(rev==ar[i])
{
System.out.println(ar[i]);
}
rev=0;
}
}
}