Leetcode 204. Count Primes (Easy) (cpp)

Leetcode 204. Count Primes (Easy) (cpp)

Tag: Hash Table, Math

Difficulty: Easy

/*

204. Count Primes (Easy)

Description:

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

*/
class Solution {
public:
    int countPrimes(int n) {
        if (n <= 1) return 0;
        vector<int> prime(n, 0);
        int cnt = 0;
        for(int i = 2; i < n; i++) {
            if(prime[i]==0) {
                cnt++;
                for(int j = 2; i * j < n; j++) {
                    prime[i * j] = 1;
                }
            }
        }
        return cnt;
    }
};