题解 | #杨辉三角#
杨辉三角
https://www.nowcoder.com/practice/e671c6a913d448318a49be87850adbcc
import java.util.Scanner; // 注意类名必须为 Main, 不要有任何 package xxx 信息 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]; 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]; } } } for(int i = 0;i<n;i++){ for(int j = 0;j<=i;j++){ System.out.printf("%5d",arr[i][j]); } System.out.println(); } } }