leetcode 118. Pascal's Triangle

最新推荐文章于 2024-02-01 18:23:29 发布

freya0608

最新推荐文章于 2024-02-01 18:23:29 发布

阅读量113

点赞数

分类专栏： leetcode算法文章标签： leetcode

本文链接：https://blog.csdn.net/u010080803/article/details/103181056

版权

leetcode算法专栏收录该内容

46 篇文章 0 订阅

订阅专栏

Given a non-negative integer *numRows*, generate the first*numRows*of Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

var generate = function(numRows) {
    var ans = [];
    for(var i=0;i<numRows;i++){
        if(i===0){
            ans[i]=[1];
            continue;
        }
        ans[i] = [];
        for(var j=0;j<=i;j++){
            if(j===0){
                ans[i][j] = ans[i-1][j];
            }else if(j===i){
                ans[i][j] = ans[i-1][j-1];
            }else{
                ans[i][j] = ans[i-1][j-1] + ans[i-1][j]
            }
        }
    }
    return ans; 
};