当n<10^5时的解法:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2021/7/15 14:27
# @Author : wutiande
def isPrime(n)->bool:
if n<=1:
return False
import math
sqr = (int)(math.sqrt(1.0*n))
for i in range(2,sqr+1):
if n%i == 0:
return False
return True
def getPrimeList(n):
"""求[1,n]范围内的素数"""
res = []
for i in range(1,n+1):
if isPrime(i) == True:
res.append(i)
return res
if __name__ == '__main__':
n = 101
ans = getPrimeList(n)
print('ans:',ans)