/*****************************************************问题描述*************************************************
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
Example:
Input: 5
Output:
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
输出杨辉三角形.
/*****************************************************我的解答*************************************************
/**
* @param {number} numRows
* @return {number[][]}
*/
var generate = function(numRows) {
var retArray = new Array(numRows);
for(var index = 0; index < numRows; index++)
{
if(index == 0)
{
retArray[index] = [1];
continue;
}
if(index == 1)
{
retArray[index] = [1,1];
continue;
}
if(index == 2)
{
retArray[index] = [1,2,1];
continue;
}
retArray[index] = [];
for(var innerIndex = 0; innerIndex <= index; innerIndex++)
{
if(innerIndex == 0 || innerIndex == index)
{
retArray[index].push(1);
continue;
}
retArray[index].push(retArray[index - 1][innerIndex - 1] + retArray[index - 1][innerIndex]);
}
}
return retArray;
};
console.log(generate(5));
leetCode刷题记录18_118_Pascal's Triangle
最新推荐文章于 2021-09-27 23:31:49 发布