杨辉三角

 # 杨辉三角，编程思想：首位和末尾数字不变，中间的是上两位相加的和
1 list01 = [1]
 2 print(list01[0])
 3 def yanghuisanjiao(number):
 4     global list01, list02
 5     list02 = []
 6     for i in range(number):
 7         list02.append(list01[0])
 8         for i in range(len(list01)-1):
 9             list02.append(list01[i]+list01[i+1])
10         list02.append((list01[-1]))
11         for i in list02:
12             print(i,end=‘ ‘)
13         print()
14         list01 = list02
15         list02 = []
16 
17 yanghuisanjiao(20)

 1 list01 = [1]
 2 list02 = []
 3 print(list01[0])
 4 for i in range(20):
 5     list02.append(list01[0])
 6     for i in range(len(list01)-1):
 7         list02.append(list01[i]+list01[i+1])
 8     list02.append((list01[-1]))
 9     for i in list02:
10         print(i,end=‘ ‘)
11     print()
12     list01 = list02
13     list02 = []

 1 def fun01(i):
 2     list01 = [1]
 3     list02 = []
 4     if i ==1:
 5         return list01
 6     else:
 7         list02.append(fun01(i - 1)[0])
 8         for j in range(len(fun01(i - 1)) - 1):
 9             list02.append(fun01(i-1)[j]+fun01(i-1)[j+1])
10         list02.append(fun01(i - 1)[-1])
11         return list02
12 
13 for i in range(1,9):
14     print(fun01(i))