Package g0201_0300.s0204_count_primes
Class Solution
java.lang.Object
g0201_0300.s0204_count_primes.Solution
204 - Count Primes\.
Medium
Given an integer `n`, return _the number of prime numbers that are strictly less than_ `n`.
**Example 1:**
**Input:** n = 10
**Output:** 4
**Explanation:** There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
**Example 2:**
**Input:** n = 0
**Output:** 0
**Example 3:**
**Input:** n = 1
**Output:** 0
**Constraints:**
*
0 <= n <= 5 * 106
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
countPrimes
public int countPrimes(int n)
-