🚀 JS | ✅

✅ Javascript code implementation

var generate = function (numRows) {
    if (!numRows) return [];
    var triangle = [];
    if (numRows >= 1) triangle.push([1]) 
    if (numRows >= 2) triangle.push( [1, 1])
    if (numRows >= 3) {
        for (let i = 1; i <= numRows-2 ; i++)
        {
            let row = [1];
            for (let j = 0; j <= i - 1; j++){
                row.push(triangle[triangle.length-1][j]+triangle[triangle.length-1][j+1]);
            }
            row.push(1)
        triangle.push(row)
        }
    }
    return triangle;
};

📢Leetcode Solution

🚀_Runtime: 42 ms, faster than 96.04% of JavaScript online submissions for Pascal's Triangle._

🚀_Memory Usage: 42.2 MB, less than 48.99% of JavaScript online submissions for Pascal's Triangle._

📢 Follow on LinkedIn

📢 Follow on Leetcode