easyRecursion
Pascal's Triangle
## Problem
Given an integer `numRows`, return the first `numRows` of **Pascal's triangle**.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Given an integer `numRows`, return the first `numRows` of **Pascal's triangle**.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Examples
Input
numRows = 5
Output
[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
First 5 rows of Pascal's triangle.
Input
numRows = 1
Output
[[1]]
Just the apex.
Constraints
1 <= numRows <= 30
Python
Loading...