Python杨辉三角生成方法详解

def generate_pascal_triangle(num_rows):
    triangle = []
    for row_idx in range(num_rows):
        row = [1] * (row_idx + 1)  # 初始化当前行为全1
        if row_idx > 1:  # 第三行开始需要计算中间值
            for col_idx in range(1, row_idx):
                row[col_idx] = triangle[row_idx - 1][col_idx - 1] + triangle[row_idx - 1][col_idx]
        triangle.append(row)
    return triangle
<h1>示例：生成5行杨辉三角</h1><p>result = generate_pascal_triangle(5)
for row in result:
print(row)</p>

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

import math
<p>def pascal_triangle_comb(num_rows):
triangle = []
for n in range(num_rows):
row = [math.comb(n, k) for k in range(n + 1)]
triangle.append(row)
return triangle</p>

def print_pascal_triangle(triangle):
    max_width = len(" ".join(map(str, triangle[-1])))
    for row in triangle:
        row_str = " ".join(map(str, row))
        print(row_str.center(max_width))
<h1>使用示例</h1><p>t = generate_pascal_triangle(6)
print_pascal_triangle(t)</p>