2021.04.19
题目描述:
思路:
简单的模拟题。其中判断素数简单用了O(n/2)的算法,O(n1/2)也可以。判断回文数将数字转为字符串,然后双指针。
代码:
package Practice;
public class Ch06Q26 {
public static void main(String[] args) {
// int num = 121;
// System.out.println(isHuiwen(num));
int count = 1;
for (int i = 2; true; i ++) {
if (isPrime(i) && isHuiwen(i)) {
System.out.print(i + " ");
if (count % 10 == 0) {
System.out.println();
}
if (count == 100) {
break;
}
count++;
}
}
}
public static boolean isPrime(int num) {
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
public static boolean isHuiwen(int num){
String str = "" + num;
int n = str.length();
for(int i = 0, j = n - 1; i < n / 2; i ++, j --)
if(str.charAt(i) != str.charAt(j)) return false;
return true;
}
}
运行效果图: