118. Pascal's Triangle
2017-04-20 11:42
183 查看
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]
]
For example, given numRows = 5,
Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
var generate = function(n) {
var result = [];
if(n == 0) {
return result
}else if(n == 1) {
return [[1]]
}
result[0] = [1];
result[1] = [1,1];
for (var row = 2; row < n; row++){
result[row] = [1];
for (var col = 1; col <= row -1; col++){
result[row][col] = result[row-1][col] + result[row-1][col-1];
result[row].push(1);
}
}
return result;
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Algorithms—118.Pascal's Triangle
- 118. Pascal's Triangle [easy] (Python)
- leetcode 118. Pascal's Triangle 解题报告
- LeetCode 118. Pascal's Triangle
- 485. Max Consecutive Ones \ 118. Pascal's Triangle
- Leetcode 118. Pascal's Triangle
- LeetCode——118. Pascal's Triangle
- leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II
- LeetCode 118. Pascal's Triangle
- 118. Pascal's Triangle
- LeetCode－118. Pascal's Triangle，119. Pascal's Triangle II
- LeetCode118. Pascal's Triangle-python(easy)
- <LeetCode OJ> 118./119. Pascal's Triangle(I / II)
- [LeetCode]118. Pascal's Triangle
- [LeetCode By Python]118. Pascal's Triangle
- 【LeetCode】118.Pascal's Triangle(easy)解题报告
- Leet Code OJ 118. Pascal's Triangle [Difficulty: Easy]
- [leetcode]118. Pascal's Triangle
- leetcodeOJ 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle