import java.util.Scanner;
public class DigitReverse {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter a digit number: ");
int number = input.nextInt();
if (isPalindrome(number))
System.out.println(number + " is a palindrome.");
else
System.out.println(number + " isn't a palindrome.");
}
public static int reverse(int number) {
final int DECIMAL = 10;
long sumNumber = 0;
int numberOfDigits = 0;
int temp = number;
while ((temp /= DECIMAL) != 0)
numberOfDigits++;
do {
sumNumber += (number % DECIMAL) * Math.pow(DECIMAL, numberOfDigits);
numberOfDigits--;
} while((number /= DECIMAL) != 0);
return (int)sumNumber;
}
public static boolean isPalindrome(int number) {
if (reverse(number) == number)
return true;
else
return false;
}
}
/****************************
Enter a digit number: 1221
1221 is a palindrome.
Enter a digit number: 333333
333333 is a palindrome.
Enter a digit number: 1234
1234 isn't a palindrome.
Enter a digit number: 7665
7665 isn't a palindrome.
*****************************/
introduction to Java Programming 编程题5.3<回文整数>
最新推荐文章于 2023-01-02 13:27:57 发布