LeetCode 204. Count Primes

最新推荐文章于 2017-10-02 10:58:41 发布

xjc864588399

最新推荐文章于 2017-10-02 10:58:41 发布

阅读量251

点赞数

分类专栏： leetcode 算法文章标签： leetcode

本文链接：https://blog.csdn.net/xjc864588399/article/details/54849670

版权

算法同时被 2 个专栏收录

46 篇文章 0 订阅

订阅专栏

leetcode

34 篇文章 0 订阅

订阅专栏

解题思路:维基百科中 https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

 Input: an integer n > 1.
 
 Let A be an array of Boolean values, indexed by integers 2 to n,
 initially all set to true.
 
 for i = 2, 3, 4, ..., not exceeding √n:
   if A[i] is true:
     for j = i2, i2+i, i2+2i, i2+3i, ..., not exceeding n:
       A[j] := false.
 
 Output: all i such that A[i] is true.

class Solution {
public:
        int countPrimes(int n) {
            if (2 >= n) return 0;
            vector<bool>primes(n,true);
            int sqr = sqrt(n - 1);
            for (int i = 2; i <= sqr; ++i){
                if (primes[i]){
                    for (int j = i * i; j < n; j += i)
                    primes[j] = false;
            }
            }
            int sum = 0;
            for (int i = 2; i < n; ++i)
                sum += (primes[i]) ? 1 : 0;
            return sum;
    }
};