AlgoDesign

Generate primes

1class Solution:
2    def generatePrimes(self, n):
3        primes, isPrime = [], [False, False] + [True] * (n - 1)
4        for i in range(2, n + 1):
5            if isPrime[i]:
6                primes.append(i)
7                for j in range(i * 2, n + 1, i): isPrime[j] = False
8        
9        return primes
10
11# time: O(nlog(logn))
12# space: O(n)   space