FilesExpand file tree

master

/

count_primes.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

15 lines (12 loc) · 464 Bytes

master

/

count_primes.py

Copy path

Top

File metadata and controls

• Code
• Blame

15 lines (12 loc) · 464 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

from typing import List

class Solution:

def _get_prime_sieve(self, size: int) -> List[int]:

sieve = [1] * (max(size, 2))

sieve[0], sieve[1] = 0, 0

for number in range(2, len(sieve)):

if sieve[number]:

for dividend in range(number ** 2, len(sieve), number):

sieve[dividend] = 0

return sieve

def countPrimes(self, n: int) -> int:

return sum(self._get_prime_sieve(n))