python 求前6行杨辉三角

代码：
print([1])
result = [1, 1]
for i in range(0, 5):
print(result)
result1 = []
for j in range(len(result)-1):
result1.append(result[0]+result[1])
result.pop(0)
result1.insert(0, 1)
result1.append(1)
result = result1.copy()

运行结果：
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]

老师的代码：
triangle = [[1], [1, 1]]
for i in range(2, 6):
cur = [1]
pre = triangle[i-1]
for j in range(len(pre)-1):
cur.append(pre[j]+pre[j+1])
cur.append(1)
triangle.append(cur)
print(triangle)

运行结果：
[[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1], [1, 5, 10, 10, 5, 1]]

老师的代码变体1：
triangle = []
n = 6
for i in range(n):
row = [1]
triangle.append(row)
if i == 0:
continue
for j in range(i-1):
row.append(triangle[i-1][j]+triangle[i-1][j+1])
row.append(1)
print(triangle)

运行结果：
[[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1], [1, 5, 10, 10, 5, 1]]

老师的代码变体2：
n = 6
oldline = []
newline = [1]
length = 0
print(newline)
for i in range(1, n):
oldline = newline.copy()
oldline.append(0)
newline.clear()
offset = 0
while offset <= i:
newline.append(oldline[offset-1]+oldline[offset])
offset += 1
print(newline)

运行结果：
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]

这里注意，i是从1开始的，到n-1结束。i为1的时候，while循环要遍历两次。
然后offset初始值为0，while第一次循环内添加的是oldline[-1]+oldline[0]即oldline中第一个和最后一个元素相加的值。

为了提高运行效率，对代码进行如下修改：
triangle = []
n = 6
for i in range(n):
row = [1]
for k in range(i):
row.append(1) if k == i-1 else row.append(0)
triangle.append(row)
if i == 0:
continue
for j in range(1,i//2+1):
val = triangle[i-1][j-1] + triangle[i-1][j]
row[j] = val
if j != i-j:
row[-j-1] = val
print(triangle)

运行结果：
[[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1], [1, 5, 10, 10, 5, 1]]