118. Pascal's Triangle

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]
]

# @lc code=start
using LeetCode

pascals_triangle(numRows::Int) = [[binomial(k, i) for i in 0:k] for k in 0:(numRows - 1)]
# @lc code=end

pascals_triangle (generic function with 1 method)

This page was generated using DemoCards.jl and Literate.jl.