def triangle1(n):
initList = [1]
for i in range(n):
print(initList)
initList.append(0)
# j = 0 时, j - 1 = 0,取数组最后一项,i + 2从0->i+1
initList = [initList[j] + initList[j - 1] for j in range(i + 2)]
triangle1(10)
def triangle2(n):
initList = [[1]]
for i in range(n):
print(initList[i])
initList[i].append(0)
initList.append([initList[i][j] + initList[i][j - 1] for j in range(i + 2)])
triangle2(10)
题目2 编写代码,打印0-n中全部素数
def prime(n):
for i in range(2, n):
flag = True
for j in range(2, i):
if i % j == 0:
flag = False
break
if flag:
print(i)
pri