我所做的杨辉三角的实现,但事情是错了,因为当col match { case row => ...}
不正确的山坳与行相匹配:模式匹配不匹配给定的变量
def main(args: Array[String]) {
println("Pascal's Triangle")
for (row <- 0 to 10) {
for (col <- 0 to row) {
val res: Int = pascal(col, row)
print(res + " ")
}
println()
}
def pascal(col: Int, row: Int): Int = {
col match {
case 0 => 1
case row => 1
case _ => pascal(col-1, row-1) + pascal(col, row-1)
}
}
当心卫兵 - https://twitter.com/travisbrown/status/714125150711451648 –
感谢您的提示! –