Solution (leetcode-in-java 1.20 API)

java.lang.Object
- g0101_0200.s0118_pascals_triangle.Solution

```
public class Solution
extends Object
```
118 - Pascal’s Triangle.
Easy

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 as shown:

Example 1:

Input: numRows = 5

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

Example 2:

Input: numRows = 1

Output: 1

Constraints:
- 1 <= numRows <= 30

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<List<Integer>> generate(int numRows)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

generate

public List<List<Integer>> generate(int numRows)