Python --- 杨辉三角

1、第一种解法

# Pascal's Triangle

n = 6
triangle = [[1], [1,1]]

for i in range(2, n):
    cur = [1]
    pre = triangle[i-1]
    
    for j in range(i-1):
        cur.append(pre[j]+pre[j+1])  # The sum of the two terms in the previous row
    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]]

2、第二种解法

# Pascal's Triangle

triangle = []
n = 6

for i in range(n):
    cur = [1]
    triangle.append(cur)
    
    if i == 0:
        continue
    pre = triangle[i-1]
    
    for j in range(i-1):
        cur.append(pre[j] + pre[j+1])
    
    cur.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]]

3、第三种解法

# Pascal's Triangle

n = 6
newline = [1]
print(newline)

for i in range(1, n):
    oldline = newline.copy()
    oldline.append(0)     
    newline.clear()
    
    for j in range(i+1):
        newline.append(oldline[j-1] + oldline[j])
        
    print(newline)

    
#           [1] 0
#         [1, 1] 0
#       [1, 2, 1] 0
#     [1, 3, 3, 1] 0
#   [1, 4, 6, 4, 1] 0
# [1, 5, 10, 10, 5, 1]

[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]

4、第四种解法

4.1 第一种思路

# Pascal's Triangle
# Version 1

triangle = []
n =6

for i in range(n):
    row = [1] * (i+1)    
    triangle.append(row)
    
    for j in range(1, i//2+1):
        val = triangle[i-1][j-1] + triangle[i-1][j]
        row[j] = val
        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]]

4.2 第二种思路

# Pascal's Triangle
# Version 2
# Improved Version

triangle = []
n =6

for i in range(n):
    row = [1] * (i+1)    
    triangle.append(row)
    
    for j in range(1, i//2+1):
        val = triangle[i-1][j-1] + triangle[i-1][j]
        row[j] = val
        
        if i != 2*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]]

5、第五种解法

5.1 第一种思路

# Pascal's Triangle
# Version 1

n = 6
row = [1] * n

print('=' * 30)

for i in range(n):
    old = 1
    
    for j in range(i//2):
        val = old + row[j+1]
        old = row[j+1]
        row[j+1] = val
        
        if i != 2*(j+1):
            row[i-(j+1)] = val
    print(row[:i+1])
print('=' * 30)

==============================
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
==============================

5.2 第二种思路

# Pascal's Triangle
# Version 2

n = 6
row = [1] * n

print('=' * 30)

for i in range(n):
    old = 1
    
    for j in range(i//2):
        row[j+1], old = old + row[j+1], row[j+1]
        
        if i != 2*(j+1):
            row[i-(j+1)] = row[j+1]
            
    print(row[:i+1])
print('=' * 30)

==============================
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
==============================