Leetcode 204. Count Primes
来源:互联网 发布:大数据分析考研 编辑:程序博客网 时间:2024/05/29 19:11
public class Solution { public int countPrimes(int n) { int cnt = 0; boolean[] prime = new boolean[n]; for (int i=2; i*i<=n; i++) for (int j=2; i*j<n; j++) prime[i*j] = true; for (int k=2; k<n; k++) if (!prime[k]) cnt++; return cnt; }}
Finding Prime numbers - Sieve of Eratosthenes
O(n^1.5) approach.
public class Solution { public int countPrimes(int n) { int count = 0; for (int i=1; i<n; i++) { if (isPrime(i)) { count++; } } return count; } public boolean isPrime(int num) { if (num == 1) { return false; } if (num == 2) { return true; } // Check if num can be divided by even numbers if (num % 2 == 0) { return false; } // Check if num can be divided by odd numbers // If num can be divided by p, that num = p * q and assume p <= q, // we can derive that p <= num^0.5 b/c (p * q) ^ 0.5 = num ^ 0.5 and p ^ 0.5 <= q ^ 0.5. // So we only need to check all odd numbers from 3 to num^0.5. for (int i=3; i<=Math.sqrt(num); i+=2) { if (num % i == 0) { return false; } } return true; }}
0 0
- 【LeetCode】204.Count Primes
- [leetcode] 204.Count Primes
- LeetCode 204. Count Primes
- Leetcode 204. Count Primes
- [LeetCode]204. Count Primes
- 204. Count Primes LeetCode
- LeetCode *** 204. 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
- LeetCode 204. Count Primes
- [leetcode] 204. Count Primes
- 204.[LeetCode]count primes
- [LeetCode] 204. Count Primes
- Leetcode 204. Count Primes
- LeetCode 9 Palindrome Number
- Android Studio导出 Jar依赖包
- 文字阴影
- MVC与webservice上传文件(图片和视频),希望帮且到一些朋友
- request&response
- Leetcode 204. Count Primes
- redis并发处理慢
- file_get_contents("php://input")的使用方法
- OSC 第 130 期高手问答 — 究竟什么才是微服务?_黄勇【摘选】
- DEDECMS之LOOP大循环使用二
- JavaScript开发记录
- Android 屏幕适配
- Python print
- MySQL闪回原理与实战