求教 杨辉三角的递归解法 python

Question

如题所述

Answer 1

1、九九乘法表

def multiplicationTable():
for i in range(1, 10):
for j in range(1, i):
print "%d * %d = %d\t" % (j, i, j * i),
print "%d * %d = %d\n" % (i, i, i * i),

if __name__ == '__main__':
multiplicationTable()
2、杨辉三角

def pascalsTriangle(n):
line = [1]
print "\t" * (n - 1),
print "%d\n" % line[-1],
for i in range(n - 1):
new_line = [1]
for j in range(i):
new_line.append(line[j] + line[j + 1])
new_line.append(1)
line = new_line
print "\t" * (n - i - 2),
for each in line[:-1]:
print "%d\t\t" % each,
print "%d\n" % line[-1],

if __name__ == '__main__':
pascalsTriangle(7)