打印杨辉三角形数据结构
时间: 2023-11-19 18:51:40 浏览: 42
好的,以下是打印杨辉三角形的 Python 代码:
```python
def print_pascal_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)
for row in triangle:
print(' '.join([str(num) for num in row]).center(n*3))
print_pascal_triangle(5)
```
输出结果为:
```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
```
相关问题
数据结构打印杨辉三角形
杨辉三角形是一个由数字构成的三角形,它的规律是每个数等于它上方两数之和。下面是一个使用数据结构打印杨辉三角形的示例代码:
```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):
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j]
for row in triangle:
print(" ".join(str(num) for num in row))
# 打印一个6行的杨辉三角形
print_yanghui_triangle(6)
```
输出结果:
```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
```
打印杨辉三角数据结构
以下是打印杨辉三角的 Python 代码:
```python
def generate(numRows):
triangle = []
for i in range(numRows):
row = [None for _ in range(i+1)]
row[0], row[-1] = 1, 1
for j in range(1, len(row)-1):
row[j] = triangle[i-1][j-1] + triangle[i-1][j]
triangle.append(row)
return triangle
def print_triangle(triangle):
numRows = len(triangle)
for i in range(numRows):
print(" "*(numRows-i-1), end="")
print(" ".join([str(x) for x in triangle[i]]))
n = 5
triangle = generate(n)
print_triangle(triangle)
```
输出为:
```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
```