java编写杨辉三角程序,其中最大为5
时间: 2024-05-03 11:18:21 浏览: 10
以下是Java编写的杨辉三角程序:
```java
public class YangHuiTriangle {
public static void main(String[] args) {
int n = 5; // 最大行数
int[][] triangle = new int[n][n];
// 构造杨辉三角
for (int i = 0; i < n; i++) {
triangle[i][0] = 1;
for (int j = 1; j <= i; j++) {
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
}
}
// 输出杨辉三角
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
System.out.print(triangle[i][j] + " ");
}
System.out.println();
}
}
}
```
输出结果为:
```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
```
相关问题
java编写杨辉三角程序,其中最大为6
以下是Java编写的杨辉三角程序,其中最大为6:
```java
public class YangHuiTriangle {
public static void main(String[] args) {
int[][] triangle = new int[6][];
for (int i = 0; i < 6; i++) {
triangle[i] = new int[i+1];
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
triangle[i][j] = 1;
} else {
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
}
System.out.print(triangle[i][j] + " ");
}
System.out.println();
}
}
}
```
输出:
```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
```
Java编写杨辉三角
下面是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[][] triangle = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
triangle[i][j] = 1;
} else {
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
}
System.out.print(triangle[i][j] + " ");
}
System.out.println();
}
}
}
```
运行程序后,输入要打印的行数,即可输出相应行数的杨辉三角。