LeetCode204 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.

题源：here

思路：

1 我们将小于n的每一个数测试一遍是否时素数；2 我们用一个vector将出现的素数记录下来，这样可以加快我们查找素数的速度；

解法1

class Solution {
public:
    int countPrimes(int n) {
        if(n<=2) return 0;
        int count(0);
        for(int i = 2;i<n;i++){
            if(notPrime(i)) continue;
            else count++;
        }
        return count;
    }
    bool notPrime(int n){
        if(n == 2) return false;
        int tmp = sqrt(n);
        for(int i = 2;i<=tmp;i++){
            if(n%i == 0) return true;
        }
        return false;
    }
};

解法2

class Solution {
public:
    int countPrimes(int n) {
        if(n <= 2) return 0;
        else if(n <= 3) return 1;
        vector<int> primes{2};
        for(int i = 3;i<n;i++){
            if(isPrime(i, primes)) primes.push_back(i);
        }
        return int(primes.size());
    }
    bool isPrime(int n, vector<int> &primes){
        for(auto i:primes){
            if(i*i>n) return true;
            if(n%i == 0) return false;
        }
        return true;
    }
};