习题 6:杨辉三角

题目:输入整数 n,使用二维数组和递推公式输出杨辉三角。

object YangTriangle {
  def main(args: Array[String]): Unit = {
    val n = readInt()
    var a = Array.ofDim[Int](n + 1, n + 1)
    a(0)(0) = 1
    for (i <- 1 to n) {
      a(i)(0) = 1
      for (j <- 1 to i) {
        a(i)(j) = a(i - 1)(j - 1) + a(i - 1)(j)
      }
    }
    for (i <- 1 to n) {
      for (j <- 0 to i) {
        print(a(i)(j) + "\t")
      }
      println()
    }
  }
}