测试回文整数(java语言程序设计习题6-3)

//使用reverse方法实现isPalindrome。输入一个整数值，然后报告整数是否是回文数。

import java.util.Scanner;

public class Three
{

public static void main(String[] args)
{
Scanner in_put = new Scanner(System.in);
int num = in_put.nextInt();
System.out.println(isPalindrome(num));

}


public static int reverse(int number)
{
String a = number + "";
int[] array = new int[a.length()];
int[] swap = new int[a.length()];
int result = 0;
int cf;
for(int i = 0; i < a.length(); i ++)
{
array[i] = a.charAt(i) - 48;
}

for(int j = 0; j < a.length(); j ++)
{
swap[j] = array[a.length() - 1 -j];
}

for(int k = 0; k < a.length(); k ++)
{
cf = (int)(Math.pow(10, (a.length() - k - 1)));
result += swap[k] * cf;
}
//System.out.println("result = " + result);
return result;



}

public static boolean isPalindrome(int number)
{
boolean pali;
int n = number;
if(number == reverse(n))
{
pali = true;
}

else 
pali = false;

return pali;
}
}