pascals-triangle-ii

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>rowIndex</code>, return the <code>rowIndexth</code> (0-indexed) row of the 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: rowIndex = 3
Output: [1,3,3,1]
</pre>Example 2:
<pre>Input: rowIndex = 0
Output: [1]
</pre>Example 3:
<pre>Input: rowIndex = 1
Output: [1,1]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= rowIndex &lt;= 33</code></li>
</ul>

&nbsp;
Follow up: Could you optimize your algorithm to use only <code>O(rowIndex)</code> extra space?

getRow

Pascal's Triangle II

Pascal's Triangle

pascals-triangle

杨辉三角

Find Triangular Sum of an Array

find-triangular-sum-of-an-array

数组的三角和

Array

Dynamic Programming

给定一个非负索引 <code>rowIndex</code>，返回「杨辉三角」的第 <code>rowIndex</code> 行。

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

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

 

示例 1:

<pre>
输入: rowIndex = 3
输出: [1,3,3,1]
</pre>

示例 2:

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

示例 3:

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

 

提示:

<ul>
	<li><code>0 <= rowIndex <= 33</code></li>
</ul>

 

进阶：

你可以优化你的算法到 <code>O(rowIndex)</code> 空间复杂度吗？