Python Day2

def getPrime(b): #埃拉托斯特尼筛法
    numList2 = list()
    flag = [0] * b
    for i in range(2,b):
        if flag[i] == 0:
            for j in range(i+1,b):
                if j%i == 0:
                    flag[j] = 1
        else: break
    for i in range(2,b):
        if flag[i] == 0:
            numList2.append(i)
    return numList2

https://zh.wikipedia.org/wiki/%E5%9F%83%E6%8B%89%E6%89%98%E6%96%AF%E7%89%B9%E5%B0%BC%E7%AD%9B%E6%B3%95