Package g0201_0300.s0204_count_primes

Class Solution

  • All Implemented Interfaces:
    
public final class 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:

    • <code>0 <= n <= 5 * 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countPrimes(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait