题解 | 杨辉三角

import java.util.Scanner

fun main(args: Array<String>) {
    val read = Scanner(System.`in`)
    val n = read.nextInt()
    var matrix = Array(n){IntArray(it+1)}

    for(i in 0 until n){
        for (j in 0..i){
            when{ j==0||j==i ->matrix[i][j]=1
            else -> matrix[i][j]=matrix[i-1][j-1]+matrix[i-1][j]
            }
        }
    }
    for (i in 0 until n) {
        for (j in 0..i) {
            print("${matrix[i][j]} ")
        }
        println()
    }
}