python算法-质数和斐波那契数列

1.输出100以内的质数

for n in range(2, 100):
    if n == 2:
        print(n)
        continue
    for i in range(2, n):
        if (n % i) == 0:
            break
    else:               # 下一行的 print(n) 事实上属于语句块 for i in range(2, n): 
        print(n)        # 整个循环结束，都没有发生 break 的情况下，才执行一次 print(n)
# 优化
def prime_1():
    prime_list = []
    for i in range(2, 100):
        if i == 2:
            prime_list.append(i)
            continue
        for j in range(2, int(i ** 0.5) + 1):
            if i % j == 0:
                break
        else:
            prime_list.append(i)
    print(prime_list)

2.输出 1000 以内的斐波那契数列

n = 1000
a, b = 0, 1
while a < n:
    print(a, end=' ')
    a, b = b, a+b
print()