Download Count Primes.py
class Solution(object): def countPrimes(self, n): """ :type n: int :rtype: int """ # https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Algorithm_complexity isPrime = [True] * n for i in xrange(2, n): if i * i >= n: break if not isPrime[i]: continue for j in xrange(i * i, n, i): isPrime[j] = False count = 0 for i in xrange(2, n): if isPrime[i]: count += 1 return count
Leetcode 204 Count Primes problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.