Find Palindrome Number

-

 package whileLoops;


import java.util.Scanner;


public class PalindromeNumber {


public static void main(String[] args) {


Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

int temp = n;

int reversedNumber = 0;

while(temp>0) {

int lastDigit = temp % 10;

reversedNumber = reversedNumber * 10 + lastDigit;

temp /= 10;

}

if (reversedNumber == n) {

System.out.println(n+ "  is palindrome");

}

else {

System.out.println(n + " is not a palindrome");

}

}


}


Comments

Post a Comment

Popular posts from this blog

Type Casting

-
 package typeCasting; public class TypeCasting { public static void main(String[] args) { // Type Casting(Widening) Automatic Type Casting byte x = 4; int y = x; double z = y; System.out.println(x); System.out.println(y); System.out.println(z); // Type Casting(narrowing) Manual Type Casting double m = 2.12324; int n = (int)m; System.out.println(m); System.out.println(n); } }
Read more

Arithmetic

-
 package opertaors; public class ArithmeticOperators { public static void main(String[] args) { int a = 10; int b = 48; int c = a * a + b * b + 2 * a * b; int d = ( a + b ) + ( a + b ); double e = (double)a/(double)b; int f =  b % a ; int g = b++; int h = a--; System.out.println(c); System.out.println(d); System.out.println(e); System.out.println(f); System.out.println(g + " " + b + " " + h + " " + a); } }
Read more

Pattern 1

-
 package nestedForLoop; import java.util.Scanner; public class Pattern1 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); for(int j=1; j<=a; j++) { for(int i=1; i<=a; i++) { System.out.print("x "); } System.out.println(); } } }
Read more