palindrome part 1(reverse a number)

 package javaprogram;


import java.util.Scanner;


public class Pelindrome1 {


public static void main(String[] args)

{

Scanner sc=new Scanner(System.in);

int actualNum=sc.nextInt(); //1331

int cloneNum = actualNum;

int revNum=0;

while(cloneNum>0)

{

int r=cloneNum%10;

revNum=revNum*10+r;

cloneNum=cloneNum/10;

}

System.out.println(revNum);

if(revNum==actualNum)

{

System.out.println("given num"+actualNum+" is pelindrome");

}

else

{

System.out.println("given num"+actualNum+" is not pelindrome");

}

}

}

Comments

Popular posts from this blog

#Prime #Numbers

Switch Case examples

palindrome part 2(reverse an String)