要求:判断一个整数是否是回文数。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。
具体代码如下:
public class Test1_19 {
public static boolean isPalindrome(int x) {
String str = String.valueOf(x);
char[] arr = str.toCharArray();
int count = 0;
int left = 0;
int right = arr.length-1;
for (int i = 0; i < arr.length; i++) {
if(arr[left] == arr[right]) {
left++;
right--;
count++;
}
}
return (count == arr.length);
}
public static void main(String[] args) {
int x = 10;
if(isPalindrome(x) == true)
System.out.println(x + "是回文数");
else
System.out.println(x + "不是回文数");
int a = 121;
if(isPalindrome(a) == true)
System.out.println(a + "是回文数");
else
System.out.println(a + "不是回文数");
}
}
运行结果实例: