-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP10_PalindromeNumber.java
More file actions
36 lines (30 loc) · 1.16 KB
/
Copy pathP10_PalindromeNumber.java
File metadata and controls
36 lines (30 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package programs;
/**
* ============================================================
* PROGRAM 10: Palindrome Number Checker
* ============================================================
* Problem: WAP to check if a given number is a Palindrome
* (reads the same forward and backward, e.g., 12321, 4554).
* ============================================================
*/
public class P10_PalindromeNumber {
public static boolean isPalindrome(int number) {
if (number < 0) return false; // negative numbers are not palindromic (e.g. -121 != 121-)
int original = number;
int reversed = 0;
while (number > 0) {
int digit = number % 10;
reversed = (reversed * 10) + digit;
number /= 10;
}
return original == reversed;
}
public static void main(String[] args) {
int[] testCases = {121, 12321, 4554, 1001, 7, 123, -121, 10};
System.out.println("=== PALINDROME NUMBER TESTS ===");
for (int n : testCases) {
System.out.printf(" Number: %6d -> %s%n",
n, isPalindrome(n) ? "✓ PALINDROME" : "✗ NOT PALINDROME");
}
}
}