204. Count Primes

Count the number of prime numbers less than a non-negative number, n.

Example:

Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.

难度：easy

题目：统计小于非负整数n的所有素数。

思路：参考素数筛选法。

Runtime: 11 ms, faster than 94.69% of Java online submissions for Count Primes.
Memory Usage: 35.9 MB, less than 21.43% of Java online submissions for Count Primes.

class Solution {public int countPrimes(int n) {boolean[] notPrimes = new boolean[n];int count = 0;for (int i = 2; i < n; i++) {if (!notPrimes[i]) {count++;for (int j = 2 * i; j < n; j += i) {notPrimes[j] = true;}}}return count;}
}

204. Count Primes相关推荐

leetCode 204. Count Primes 哈希求素数
204. Count Primes 求素数 Description: Count the number of prime numbers less than a non-negative number ...
【LeetCode 剑指offer刷题】特殊数题3：204 Count Primes
[LeetCode & 剑指offer 刷题笔记]目录(持续更新中...) 204. Count Primes Count the number of prime numbers less t ...
[LeetCode] 204. Count Primes
204. Count Primes Count the number of prime numbers less than a non-negative number, n. Example: Inp ...
LeetCode 204. Count Primes
注:质数从2开始,2.3-- 改进过程: 一.常规思路是对小于n的每一个数进行isPrime判断,isPrime(int x)函数中for(int i = 2; i <= x /2; ++i), ...
letecode [204] - Count Primes
Count the number of prime numbers less than a non-negative number, n. Example: Input: 10 Output: 4 E ...
leetcode python3 简单题204. Count Primes
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二百零四题 (1)题目英文: Count the number of prime ...
LeetCode -- 204. Count Primes
题目标签 HashTab(哈希表) 题意及思路题意:略思路:有关素数的题目我所知道有两种做法.一种是最基本的isPrime算法,关键点在循环判断时,上限为Math.sqrt(n) (求n是否为素数 ...
Leetcode-204 Count Primes
#204 Count Primes Count the number of prime numbers less than a non-negative number, n. 题解:这道题如果对每个小 ...
LeetCode 204. Count Primes--从一开始的质数个数--Python解法--面试算法题
题目地址:Count Primes - LeetCode Count the number of prime numbers less than a non-negative number, n. E ...

204. Count Primes

204. Count Primes相关推荐

最新文章

热门文章