Skip to content

Files

Latest commit

7a7d3f2 · Oct 20, 2020

History

History
51 lines (26 loc) · 987 Bytes

File metadata and controls

51 lines (26 loc) · 987 Bytes

中文文档

Description

Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.

Note that the row index starts from 0.


In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 3

Output: [1,3,3,1]

Follow up:

Could you optimize your algorithm to use only O(k) extra space?

Solutions

Python3

Java

...