g0201_0300.s0204_count_primes.readme.md Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

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 * 10⁶