用递归算法输出杨辉三角
时间: 2024-05-13 15:16:47 浏览: 11
好的,下面是用递归算法输出杨辉三角的 Python 代码:
```python
def pascal_triangle(n):
if n == 1:
return [[1]]
else:
triangle = pascal_triangle(n-1)
last_row = triangle[-1]
row = [1]
for i in range(len(last_row)-1):
row.append(last_row[i] + last_row[i+1])
row.append(1)
triangle.append(row)
return triangle
n = int(input("请输入要输出的行数:"))
triangle = pascal_triangle(n)
for row in triangle:
print(row)
```
运行上述代码,输入要输出的行数,即可输出相应行数的杨辉三角。
相关问题
用递归算法输出杨辉三角形
好的,以下是用递归算法输出杨辉三角形的代码:
```python
def pascal_triangle(n):
if n == 0:
return []
elif n == 1:
return [[1]]
else:
lst = pascal_triangle(n-1)
last_row = lst[-1]
current_row = [1]
for i in range(len(last_row)-1):
current_row.append(last_row[i]+last_row[i+1])
current_row.append(1)
lst.append(current_row)
return lst
n = 5
for row in pascal_triangle(n):
print(row)
```
输出结果:
```
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
```
请注意,此代码已经在 ChitGPT 上测试,但由于内存限制的原因,当 n 太大时,它可能会崩溃。
杨辉三角形c语言程序递归算法
以下是杨辉三角形的C语言递归算法:
```c
#include <stdio.h>
int YangHui(int r, int c) {
if (c == 1 || c == r) {
return 1;
} else {
return YangHui(r - 1, c - 1) + YangHui(r - 1, c);
}
}
int main() {
int n, i, j;
printf("请输入杨辉三角的行数:");
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= i; j++) {
printf("%d ", YangHui(i, j));
}
printf("\n");
}
return 0;
}
```