https://leetcode-cn.com/problems/pascals-triangle/ 数组

基础

  1. function generate(numRows: number): number[][] {
  2.     let result: number[][] = []
  3.     for(let i = 0; i < numRows; i++) {
  4.         if(i === 0) {
  5.             result.push([1])
  6.         } else if (i === 1) {
  7.             result.push([1,1])
  8.         } else {
  9.             let res = []
  10.             for(let j = 1; j < result[i - 1].length; j++) {
  11.                 res.push(result[i - 1][j - 1] + result[i - 1][j])
  12.             }
  13.             result.push([1, ...res, 1])
  14.         }
  15.     }
  16.     return result
  17. };