[LeetCode] 118. Pascal's Triangle

原题链接：https://leetcode.com/problems/pascals-triangle/

1. 题目介绍

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.

Example:

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

2. 解题思路

动态规划

class Solution {
    public List<List<Integer>> generate(int numRows) {
        if(numRows == 0){
            return new ArrayList<>();
        }
        int [][] dp = new int[numRows][numRows+1];
        dp[0][1] = 1;
        for(int i = 1; i <numRows; i++){
              for(int j = 1; j<=i+1 ;j ++){
                  dp[i][j] = dp[i-1][j]+ dp[i-1][j-1];
              }
        }
        
        List<List<Integer> >ans = new ArrayList<>();
        for(int i = 0; i <numRows; i++ ){
            List<Integer> l = new ArrayList<>();
            for(int j = 1; j <=i+1; j++){
                l.add(dp[i][j]);
            }
            ans.add(l);
        }
        return ans;
    }
}