java 正杨辉三角的程序
时间: 2024-02-15 16:05:48 浏览: 53
以下是 Java 实现正杨辉三角的程序:
```java
import java.util.Scanner;
public class YangHuiTriangle {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("请输入杨辉三角的行数:");
int n = input.nextInt();
int[][] yangHui = new int[n][n];
for (int i = 0; i < n; i++) {
yangHui[i][0] = 1;
yangHui[i][i] = 1;
}
for (int i = 2; i < n; i++) {
for (int j = 1; j < i; j++) {
yangHui[i][j] = yangHui[i - 1][j - 1] + yangHui[i - 1][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
System.out.print(yangHui[i][j] + "\t");
}
System.out.println();
}
}
}
```
运行程序后,输入杨辉三角的行数,程序会输出相应行数的正杨辉三角。
阅读全文