package shifoushihuiwen;
import java.util.Scanner;
public class ShiFouShiHuiWen
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Please enter your number: ");
int number=input.nextInt();
int panDuan;
panDuan=isPalindrome(number); //調用函數isPalindrome(number)，并傳回一個整型數
if(panDuan==1)
System.out.println( number+" is palindrome");
else
System.out.println(number+" is not palindrome");//輸出結果
}
public static int isPalindrome(long number1)
{
int weiShu=0,chuShu=1,shang=1;
while (shang!=0)
{
shang=(int)number1/chuShu;
weiShu=weiShu+1;
chuShu=chuShu*10;
}
weiShu=weiShu-1; //計算number的位數
long number2=0,numberc,jiWei,quanZhi=1;
numberc=number1;
if (weiShu==1)
return 1; //當number位數為一位時，它必是回文整數
else
{
for(int j=2;j<=weiShu;j++)
quanZhi=quanZhi*10;
for(long i=quanZhi;i>=1;i=i/10)
{
jiWei=number1/i;
number2=number2+jiWei*quanZhi/i;