所在目录:
教材与参考资料 / 程序设计类 / 数据结构＆算法 / 算法 / 面试与力扣题目详解 / Leetcode题目和解答 / java-leetcode / pascals-triangle
下载地址:
文本预览:
## Recursion
from the definition, it is easy to know
```
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
0 1 2 3 4
//i start from 0
row[0] = 1
row[last] = 1
row[i] = prev_row[i] + prev_row[i - 1]
```
点赞
回复
