工具包 - 素数/质数

import java.util.*;
import java.util.concurrent.LinkedBlockingQueue;
/**
 * 素数工具
 */
public class PrimeUtil {
    /**
     * 判断是否为素数
     * @param number
     * @return
     */
    public static boolean isPrime(int number) {
        if (number <= 0) {
            throw new IllegalArgumentException("number must be positive integer");
        }
        // 小于2 || 偶数 直接返回false
        if (number < 2 || number % 2 == 0) {
            return false;
        }
        int k = (int) Math.sqrt(number);
        for (int j = 2; j <= k; j++) {
            if (number % j == 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * 查询范围内的素数
     * @param low
     * @param high
     * @return
     */
    public static Queue<Integer> prime(int low, int high) {
        if (low <= 0) {
            throw new IllegalArgumentException("low must be positive integer");
        }
        if (low < 2) {
            low = 2;
        }

        Queue<Integer> queue = new LinkedBlockingQueue<>();
        for (int i = low; i <= high; i++) {
            // 排除大于2的偶数
            if (i > 2 && i % 2 == 0) {
                continue;
            }

            // j:[2, Math.sqrt(i)]
            int j = 2, k = (int) Math.sqrt(i);
            boolean isPrime = true;
            for (; j <= k; j++) {
                if (i % j == 0) {
                    System.out.println(i + " % " + j + " = " + (i % j));
                    isPrime = false;
                    break;
                }
            }
            if (isPrime) {
                queue.add(i);
                System.out.println("--> " + i + " add queue.");
            }
        }
        return queue;
    }

    public static void main(String[] args) {
        Queue<Integer> queue = prime(0,100);
        System.out.println(queue.toString());
        for (int i = 1; i < 100; i++) {
            if (isPrime(i)) {
                System.out.println(i + " is prime.");
            }
        }
    }
}