pascals-triangle

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>numRows</code>.

Return the first <code>numRows</code> of Pascal&#39;s triangle.

In Pascal&#39;s triangle, each number is the sum of the two numbers directly above it and the first and last number on each row must be equal to 1, as shown below:
<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif" style="height:240px; width:260px" />
&nbsp;
Example 1:
<pre>Input: numRows = 5
Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
</pre>Example 2:
<pre>Input: numRows = 1
Output: [[1]]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= numRows &lt;= 30</code></li>
</ul>

generate

Pascal's Triangle

Array

Dynamic Programming

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are 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 and the first and last number on each row must be equal to 1, as shown below:

[https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif]

 

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