L = [1] while True: yield L L = [sum(i) for i in zip([0]+L, L+[0])]
def YangHui (num = 10): LL = [[1]] for i in range(1,num): LL.append([(0 if j== 0 else LL[i-1][j-1])+ (0 if j ==len(LL[i-1]) else LL[i-1][j]) for j in range(i+1)]) return LL
两种方式都用到了 0 进行边界计算的技巧.
看看别人的代码哈哈,果然帮助很大
看看别人写的,再看看自己写的就是一坨屎,写的真简洁,美妙
Sign in to make a reply
堕落_永远