python输出杨辉三角
时间: 2023-07-06 18:41:38 浏览: 53
好的,下面是Python代码实现杨辉三角的输出:
```python
def generate(numRows):
if numRows == 0:
return []
if numRows == 1:
return [[1]]
triangle = [[1], [1, 1]]
for i in range(2, numRows):
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
n = int(input("请输入杨辉三角的行数:"))
result = generate(n)
for i in range(n):
print(" " * (n-i), end="")
for j in range(i+1):
print(result[i][j], end=" ")
print()
```
输入行数,程序会输出杨辉三角,示例如下:
```
请输入杨辉三角的行数:6
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
```
相关问题
Python输出杨辉三角形
好的,以下是Python代码输出杨辉三角形:
```
n = int(input("请输入行数:"))
# 初始化二维数组
triangle = [[0 for col in range(n)] for row in range(n)]
# 设置第一列的值为1
for i in range(n):
triangle[i][0] = 1
# 填充剩余的值
for i in range(1, n):
for j in range(1, i+1):
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j]
# 输出杨辉三角形
for i in range(n):
for j in range(i+1):
print(triangle[i][j], end=" ")
print()
```
运用python输出杨辉三角
以下是用 Python 输出杨辉三角的代码:
```python
def generate(numRows):
triangle = []
for i in range(numRows):
row = [1] * (i + 1)
for j in range(1, i):
row[j] = triangle[i - 1][j - 1] + triangle[i - 1][j]
triangle.append(row)
return triangle
n = int(input("请输入要输出的行数:"))
result = generate(n)
for i in range(n):
print(" " * (n - i - 1), end="")
for j in range(i + 1):
print(result[i][j], end=" ")
print()
```
希望对你有帮助!