leetcode204-count-primes-method1.py

classSolution:
defcountPrimes(self, n: int) ->int:
ifn<2:
return0
else:
isDelete= [False]*n
max0=int(math.sqrt(n))
count=0
foriinrange(2, n):
ifisDelete[i] ==True:
continue
count+=1

ifi>max0:
continue

forjinrange(i*i, n, i):
isDelete[j] =True
returncount