描述:
还记得中学时候学过的杨辉三角吗?具体的定义这里不再描述,你可以参考以下的图形: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 .............. 先在给你一个正整数n,请你输出杨辉三角的前n层 注意:层数从1开始计数,每层数字之间用一个空格隔开,行尾不要有空格。 如n=2,则输出: 11 1
from __future__ import print_function # n = 5 def yanghui(n): lists = [['0' for y in range(n) ] for x in range(n)] if n >= 1: lists[0][0] = '1' print(lists[0][0]) for i in range(1,n): for j in range(0,i+1): # print(i,j) if j == 0: lists[i][j] = lists[i-1][j] elif j == i: lists[i][j] = lists[i - 1][j-1] else: lists[i][j] = str(int(lists[i - 1][j - 1]) + int(lists[i - 1][j])) print(' '.join(lists[i][0:i+1])) yanghui(n)