[LeetCode]204. Count Primes
2017-08-06 19:53
435 查看
Description:
Count the number of prime numbers less than a non-negative number, n.
public class Solution {
public int countPrimes(int n) {
int res=0;
boolean[] prime = new boolean
; //false:prime; true:prime
for(int i=2; i<n; i++){
if(!prime[i]){
res++;
for(int j=2;j*i<n; j++)
prime[j*i]=true;
}
}
return res;
}
}
Count the number of prime numbers less than a non-negative number, n.
public class Solution {
public int countPrimes(int n) {
int res=0;
boolean[] prime = new boolean
; //false:prime; true:prime
for(int i=2; i<n; i++){
if(!prime[i]){
res++;
for(int j=2;j*i<n; j++)
prime[j*i]=true;
}
}
return res;
}
}
相关文章推荐
- leetcode 204. Count Primes
- [LeetCode]204. Count Primes
- LeetCode204. Count Primes
- LeetCode 204. Count Primes
- Leetcode:204. Count Primes 求素数的优化问题
- (LeetCode) 204. Count Primes
- [leetcode]204. Count Primes
- leetcode 204. Count Primes
- Leetcode 204. Count Primes
- LeetCode204. Count Primes
- leetcode 204. Count Primes
- 【LeetCode】204. Count Primes
- LeetCode笔记:204. Count Primes
- [LeetCode]--204. Count Primes
- LeetCode 204. Count Primes
- 【LeetCode】 204. Count Primes
- leetcode204. Count Primes
- leetcode 204. Count Primes
- LeetCode 204. Count Primes
- Leetcode 204. Count Primes