vera清浅的博客先来看这样一段代码: def triangle(num):#num是打印杨辉三角的行数 triangle=[] sublist=[] for i in range(1,num+1): sublist.append(1) for j in range(1,i-1): sublist[-j-1]=sublist[-j-1]+sublist[-j-2]#从...
晒冷-的博客先来看一下普通的杨辉三角,代码和输出是长成这样 def YangHui(n): print([1]) line = [1,1] for i in range(2,n): r = [] for j in range(0,len(line) - 1): r.append(line[j] + line[j + 1]...
weixin_39775896的博客 所以获取杨辉三角的函数可以简单写成 def yanghui(n): line = [1] result = [line] for i in range(n - 1): line = [left + right for left, right in zip(line + [0], [0] + line)] result.append(line) return ...
钢七连软件实战技术的博客#2020.8.12 杨辉三角和居中 N=[1] def prtLine(): global N N=[1]+ [ N[i]+N[i+1] for i in range(len(N)-1) ] +[1] # print( N[i]+N[i+1] for i in range(len(N)-1) ) ''' print(N) for i in range(5): ...