LeetCode力扣 118. 杨辉三角 Pascal s Triangle 题解代码 JavaScript

问题 ​​https://leetcode-cn.com/problems/pascals-triangle/​​

练习使用JavaScript解答

/**
 * @param {number} numRows
 * @return {number[][]}
 */
var generate = function(numRows) {
    if(numRows < 1)
        return [];
    var arrd = [[1]];
    for(var i=1; i < numRows; ++i) {
        var arr =[1];
        for(j=1; j<i; ++j) {
            arr[j] = arrd[i-1][j-1] + arrd[i-1][j];
        }
        arr[j] = 1;
        arrd[i] = arr;
    }
    return arrd;
};