Java语言程序设计与数据结构（基础篇）chapter6 6.26

回文素数

package com.sugarpie.classtest06;

/**
 * 显示前100个回文素数
 *
 * @author sugarpie
 * @create 2021-04-08-14:47
 */
public class PalinPrimeTest {
    static final int NUMBER_OF_LINE = 10;
    static final int NUMBER_OF_NUMBER = 100;
    public static boolean isPrime(int number){
        boolean isPrime = true;
        for (int i = 2;i <= number / 2;i++){
            if (number % i == 0){
                isPrime = false;
                break;
            }
        }
        return isPrime;
    }
    public static boolean isPalindrome(int number){
        boolean isPalindrome = true;
        String strPalindrome = number + "";
        int low = 0;
        int high = strPalindrome.length() - 1;
        for (int i = low,j = high;i < j;i++,j--){
            if (strPalindrome.charAt(i) != strPalindrome.charAt(j)){
                isPalindrome = false;
                break;
            }
        }
        return isPalindrome;
    }
    public static void printNumber(int number,int count){
        if (count % NUMBER_OF_LINE == 0){
            System.out.println(number);
        }else {
            System.out.print(number + " ");
        }
    }
    public static void main(String[] args) {
        int count = 0;
        int number = 2;
        while (count < NUMBER_OF_NUMBER){
            if (isPrime(number) && isPalindrome(number)){
                count++;
                printNumber(number,count);
            }
            number++;
        }
    }
//    static final int NUMBER_OF_LINE = 10;
//    static final int NUMBER_OF_NUMBER = 100;
//    public static void main(String[] args) {
//        int count = 0;
//        int number = 2;
//        boolean isPrime = true;
//        boolean isPalindrome = true;
//        while (count < NUMBER_OF_NUMBER){
//            for (int i = 2;i <= number / 2;i++){
//                if (number % i == 0){
//                    isPrime = false;
//                    break;
//                }
//            }
//            String strPalindrome = number + "";
//            int low = 0;
//            int high = strPalindrome.length() - 1;
//            for (int i = low,j = high;i < j;i++,j--){
//                if (strPalindrome.charAt(i) != strPalindrome.charAt(j)){
//                    isPalindrome = false;
//                    break;
//                }
//            }
//            if (isPrime && isPalindrome){
//                count++;
//                if (count % NUMBER_OF_LINE == 0){
//                    System.out.println(number);
//                }else {
//                    System.out.print(number + " ");
//                }
//            }
//            isPrime = true;
//            isPalindrome = true;
//            number++;
//        }
//    }
}

运行结果：