<p>Given an integer <code>n</code>, return <em>the number of prime numbers that are strictly less than</em> <code>n</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 4
<strong>Explanation:</strong> There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 0
<strong>Output:</strong> 0
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= n &lt;= 5 * 10<sup>6</sup></code></li>
</ul>

class Solution {
public:
    int countPrimes(int n) {
        // Sieve of Eratosthenes
        int count = 0;
        vector<bool> temp(n + 1, true);
        temp[0] = temp[1] = 0;
        for (int i = 0; i < n; i++) {
            if (temp[i]) {
                count++;
                temp.push_back(i);
                for (int j = 2 * i; j < n; j = j + i) {
                    temp[j] = 0;
                }
            }
        }
        return count;
    }
    };
17340