Commit 28a19e5

committed

add solution in Python for 0204_count_primes.py

1 parent 6649903 commit 28a19e5Copy full SHA for 28a19e5

File tree

-2

lines changed

-2

lines changed

Lines changed: 6 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,11 +2,15 @@ def countPrimes(self, number: int) -> int:`
`2`	`2`	`counter = 0`
`3`	`3`	`if (number == 0 or number == 1):`
`4`	`4`	`return 0`
`5`		`-`
	`5`	`+ # Consider that all indices in array, starting`
	`6`	`+ # from 2 are prime numbers`
`6`	`7`	`primeNumbers = [True for i in range(number)]`
`7`	`8`	`primeNumbers[0] = primeNumbers[1] = False`
`8`		`-`
	`9`	`+ # Iterate through all indices`
`9`	`10`	`for i in range(2, number):`
	`11`	`+ # If indice is a prime number, mark each`
	`12`	`+ # indice, which is multiple one of the i`
	`13`	`+ # as composite one`
`10`	`14`	`if(primeNumbers[i]):`
`11`	`15`	`for j in range(2 * i, number, i):`
`12`	`16`	`primeNumbers[j] = False`

Comments

(0)