LeetCode-Array-118. Pascal's Triangle
2016-12-12 20:22
483 查看
问题：Given numRows,generate the first numRows of Pascal’s triangle.For example,
given numRows = 5,Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
思考：帕斯卡三角形的规律：(1)第i层有i个元素;(2)第一个和最后一个元素值为1;(3)第i层第j个元素值为A[i][j]=A[i-1][j-1]+A[i-1][j]。所以用一个二维数组来存储次三角形。
代码：
given numRows = 5,Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
思考：帕斯卡三角形的规律：(1)第i层有i个元素;(2)第一个和最后一个元素值为1;(3)第i层第j个元素值为A[i][j]=A[i-1][j-1]+A[i-1][j]。所以用一个二维数组来存储次三角形。
代码：
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode-118. Pascal's Triangle
- Leetcode-118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- <LeetCode OJ> 118./119. Pascal's Triangle(I / II)
- leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II
- LeetCode 118. Pascal's Triangle
- Leetcode 118. Pascal's Triangle (Easy) (cpp)
- leetcode 118. Pascal's Triangle
- 【Leetcode】118. Pascal's Triangle
- [LeetCode]118.Pascal's Triangle
- 118. Pascal's Triangle LeetCode
- [LeetCode]118. Pascal's Triangle
- leetcode 118. Pascal's Triangle（杨辉三角）
- leetcode118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
- [leetcode]118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- [LeetCode By Python]118. Pascal's Triangle
- Leetcode 118. Pascal's Triangle 杨辉三角 解题报告