怎么输出杨辉三角的代码
时间: 2024-05-03 16:20:31 浏览: 3
以下是Python语言输出杨辉三角的代码:
```python
def printYanghuiTriangle(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)
for row in triangle:
print(row)
printYanghuiTriangle(5) # 输出杨辉三角的前5行
```
输出结果为:
```
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
```
相关问题
用swift输出杨辉三角代码
我没有关于Swift输出杨辉三角代码的知识,但我可以给出一个用Python实现杨辉三角输出的示例代码:def yanghui(n):
L = [1]
while len(L) < n:
yield L
L = [1] + [L[i] + L[i + 1] for i in range(len(L) - 1)] + [1]
for i in yanghui(10):
print(i)
java代码输出杨辉三角形
以下是 Java 代码输出杨辉三角形:
```
import java.util.Scanner;
public class YangHuiTriangle {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("请输入杨辉三角形的行数:");
int n = sc.nextInt();
int[][] arr = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
arr[i][j] = 1;
} else {
arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j];
}
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
```