pascals-triangle

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer <code>numRows</code>, return the first numRows of Pascal&#39;s triangle.

In Pascal&#39;s triangle, each number is the sum of the two numbers directly above it as shown:
<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

Pascal's Triangle II

pascals-triangle-ii

杨辉三角 II

Check If Digits Are Equal in String After Operations II

check-if-digits-are-equal-in-string-after-operations-ii

判断操作后字符串中的数字是否相等 II

Array

Dynamic Programming

给定一个非负整数 <code>numRows</code>，生成「杨辉三角」的前 <code>numRows</code> 行。

在「杨辉三角」中，每个数是它左上方和右上方的数的和。

<img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" />

 

示例 1:

<pre>
输入: numRows = 5
输出: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
</pre>

示例 2:

<pre>
输入: numRows = 1
输出: [[1]]
</pre>

 

提示:

<ul>
	<li><code>1 <= numRows <= 30</code></li>
</ul>