正文
java找回文素数源代码,JAVA回文素数
提示：扫一扫查出行【扫一扫了解最新限行尾号】
复制提示
Java回文素数编码救助
修改后的代码：
import java.util.Scanner;
public class test{
public static void main (String[] args){
Scanner input = new Scanner(System.in);
System.out.print("Please enter a positive integer");
int i = input.nextInt();
printNumber(i); //修改处
}
public static void printNumber (int i){
if (isPalindrome(i) isPrime(i)) {
System.out.println(i);
}
}
public static boolean isPalindrome(int i){
int palindrome = i;
int reverse =0;
while (palindrome !=0){
int remainder = palindrome % 10;
reverse = reverse *10 + remainder;
palindrome = palindrome/10;
}
if (i==reverse){
return true;
}
return false;
}
public static boolean isPrime (int i){
int counter = 2;
while(counteri){
if (i%counter ==0)
return false;
counter ++;
}
return true;
}
}
运行测试：
Please enter a positive integer101
101
Please enter a positive integer11
11
相关问答
Q1: java编程 回文素数
你的逻辑判断要写在while外面
public static boolean two(int b){
boolean flag = true;
int d=b;
int c = 0 ;
while(b 0){
c *= 10;
c += (b % 10);
b /= 10;
}
if(d != c ){
flag = false;
}
return flag;
}
}
Q2: java实现1000以内回文素数（质数）
public class $ {
public static void main(String[] args) {
for (int i = 1; i = 1000; i++) {
if (!check(i)) {
continue;
}
if (huiweishu(i)) {
System.out.println(i);
}
}
}
private static boolean check(int num) {
int sqrt = (int) Math.sqrt(num);
for (int j = 2; j sqrt + 1; j++) {
if (num % j == 0) {
return false;
}
}
return true;
}
private static boolean huiweishu(int i) {
int a;
if (i 99) {
a = i / 10;
} else {
a = i / 100;
}
return a == i % 10;
}
}
11
101
131
151
181
191
313
353
373
383
727
757
787
797
919
929
