**6.3(回文整数)使用下面的方法头编写两个方法: // Return the reversal of an integer, e.g., reverse(456) returns 654 public static int reverse(int number) // Return true if number is a palindrome public static boolean isPalindrome(int number) 使用reverse方法实现isPalindrome。如果一个数字的逆序数和它自身相等,这个数就称作回文数。编写一个测试程序,提示用户输入一个整数值,然后报告这个整数是否是回文数。 **6.3(Palindrome integer) Write the methods with the following headers: // Return the reversal of an integer, e.g., reverse(456) returns 654 public static int reverse(int number) // Return true if number is a palindrome public static boolean isPalindrome(int number) Use the reverse method to implement isPalindrome. A number is a palindrome if its reversal is the same as itself. Write a test program that prompts the user to enter an integer and reports whether the integer is a palindrome.
参考代码:
package chapter06;
import java.util.Scanner;publicclassCode_03{publicstaticvoidmain(String[] args){
Scanner input =newScanner(System.in);
System.out.print("Enter an integer: ");int number = input.nextInt();if(isPalindrome(number))
System.out.println(number +" is a palindrome");else
System.out.println(number +" is not a palindrome");}publicstaticintreverse(int number){int reverseNumber =0;do{
reverseNumber = reverseNumber *10+ number %10;
number /=10;}while(number >0);return reverseNumber;}publicstatic boolean isPalindrome(int number){return(number ==reverse(number));}}
结果显示:
Enter an integer:232232 is a palindrome
Process finished with exit code 0
第六章第三题(回文整数)(Palindrome integer)**6.3(回文整数)使用下面的方法头编写两个方法:// Return the reversal of an integer, e.g., reverse(456) returns 654public static int reverse(int number)// Return true if number is a palindromepublic static boolean isPalindrome(int number)