0
点赞
收藏
分享

微信扫一扫

LeetCode-204-计数质数

janedaring 2021-09-28 阅读 95
LeetCode

计数质数

解法一:暴力破解法
public class LeetCode_204 {
    /**
     * 暴力破解法:提交后超出时间限制,性能不好
     * @param n
     * @return
     */
    public static int countPrimes(int n) {
        int result = 0;
        for (int i = 2; i < n; i++) {
            if (isPrime(i)) {
                result++;
            }
        }
        return result;
    }

    public static boolean isPrime(int num) {
        if (num == 2 || num == 3) {
            return true;
        }
        boolean result = true;
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return result;
    }

    public static void main(String[] args) {
        System.out.println(countPrimes(1500000));
    }
}
举报

相关推荐

0 条评论