回文数程序 Java 使用 while 和 for 循环
什么是回文数?
A 回文数 是反转后仍为原数的数。例如 131,反转数字后仍为原数。回文数在纵轴上具有反射对称性。它指的是字母反转后拼写相同的单词。
回文数的例子 Java
121, 393, 34043, 111, 555, 48084
回文数的例子
LOL, MADAM
回文数算法
下面是回文数算法逻辑 Java:
- 获取需要检查的输入数字 回文
- 将数字复制到临时变量中并将其反转。
- 比较反转后的数字和原数字。
- 如果相同,则该数字为“回文数”
- 否则数字不是“回文数”
如何检查输入的数字是否是回文
下面是一个回文程序 Java - WHILE 循环
package com.guru99;
public class PalindromeNum {
public static void main(String[] args)
{
int lastDigit,sum=0,a;
int inputNumber=171; //It is the number to be checked for palindrome
a=inputNumber;
// Code to reverse a number
while(a>0)
{ System.out.println("Input Number "+a);
lastDigit=a%10; //getting remainder
System.out.println("Last Digit "+lastDigit);
System.out.println("Digit "+lastDigit+ " was added to sum "+(sum*10));
sum=(sum*10)+lastDigit;
a=a/10;
}
// if given number equal to sum than number is palindrome otherwise not palindrome
if(sum==inputNumber)
System.out.println("Number is palindrome ");
else
System.out.println("Number is not palindrome");
}
}
代码输出:
Input Number 171 Last Digit 1 Digit 1 was added to sum 0 Input Number 17 Last Digit 7 Digit 7 was added to sum 10 Input Number 1 Last Digit 1 Digit 1 was added to sum 170 Number is palindrome
使用 for 循环检查回文的程序
下面是一个 Java 使用 for 循环的回文程序
package com.guru99;
public class PalindromeNum {
public static void main(String[] args)
{
int lastDigit,sum=0,a;
int inputNumber=185; //It is the number to be checked for palindrome
a=inputNumber;
// Code to reverse a number
for( ;a != 0; a /= 10 )
{ System.out.println("Input Number "+a);
lastDigit=a%10; //getting remainder
System.out.println("Last Digit "+lastDigit);
System.out.println("Digit "+lastDigit+ " was added to sum "+(sum*10));
sum=(sum*10)+lastDigit;
a=a/10;
}
// if given number equal to sum than number is palindrome otherwise not palindrome
if(sum==inputNumber)
System.out.println("Number is palindrome ");
else
System.out.println("Number is not palindrome");
}
}
代码输出:
Input Number 185 Last Digit 5 Digit 5 was added to sum 0 Input Number 1 Last Digit 1 Digit 1 was added to sum 50 Number is not palindrome
