python 打印出杨辉三角形前十行。
时间: 2023-09-12 22:13:39 浏览: 52
好的,下面是 Python 代码实现:
```python
def generate_triangle(n):
# 初始化第一行
triangle = [[1]]
for i in range(1, n):
# 上一行
prev_row = triangle[-1]
# 当前行
curr_row = [1]
# 计算中间的数
for j in range(1, i):
curr_row.append(prev_row[j - 1] + prev_row[j])
# 最后一个数
curr_row.append(1)
# 添加到杨辉三角
triangle.append(curr_row)
return triangle
# 打印前十行
for row in generate_triangle(10):
print(row)
```
输出结果为:
```
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
[1, 6, 15, 20, 15, 6, 1]
[1, 7, 21, 35, 35, 21, 7, 1]
[1, 8, 28, 56, 70, 56, 28, 8, 1]
[1, 9, 36, 84, 126, 126, 84, 36, 9, 1]
```
相关问题
使用python编程打印出杨辉三角形前10行
以下是python编程打印出杨辉三角形前10行的代码:
```
def yanghui_triangle(n):
triangle = [[1]]
for i in range(1, n):
row = [1]
for j in range(1, i):
row.append(triangle[i-1][j-1] + triangle[i-1][j])
row.append(1)
triangle.append(row)
return triangle
for row in yanghui_triangle(10):
print(row)
```
输出结果如下:
```
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
[1, 6, 15, 20, 15, 6, 1]
[1, 7, 21, 35, 35, 21, 7, 1]
[1, 8, 28, 56, 70, 56, 28, 8, 1]
[1, 9, 36, 84, 126, 126, 84, 36, 9, 1]
```
编写python函数打印出杨辉三角形前十行。
好的,以下是Python函数实现杨辉三角形前十行的代码:
```python
def print_yanghui_triangle(n):
triangle = [[1] * (i + 1) for i in range(n)] # 初始化二维列表
for i in range(2, n): # 从第三行开始计算
for j in range(1, i): # 第一列和最后一列都是1,不需要计算
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j] # 递推公式
for row in triangle:
print(' '.join(map(str, row))) # 输出每一行
```
你可以直接调用`print_yanghui_triangle(10)`来输出杨辉三角形的前十行。