等腰三角:
输出样例:
import java.util.Scanner;
public class Main{
public static void main(String[]args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();//杨辉三角行数
int arr[][] = new int [n][n];
arr[0][0] = 1;
for(int i = 1;i<n;i++) {
arr[i][0] = 1;
arr[i][n-1] = 1;
for(int j = 1;j<n-1;j++) {
arr[i][j] = arr[i-1][j-1]+arr[i-1][j];
}
}
for(int i = 0;i<n;i++) {
for(int k = 0;k<(n-1-i);k++) {
System.out.print(" ");
}
for(int j = 0;j<i+1;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
直角三角:
输出样例:
import java.util.Scanner;
public class Main{
public static void main(String[]args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();//杨辉三角行数
int arr[][] = new int [n][n];
arr[0][0] = 1;
for(int i = 1;i<n;i++) {
arr[i][0] = 1;
arr[i][n-1] = 1;
for(int j = 1;j<n-1;j++) {
arr[i][j] = arr[i-1][j-1]+arr[i-1][j];
}
}
for(int i = 0;i<n;i++) {
//等腰的这部分代码去掉就是直角
// for(int k = 0;k<(n-1-i);k++) {
// System.out.print(" ");
// }
for(int j = 0;j<i+1;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}