From 68014e9f4b1c5bc37592e180cb4b3298c074fb94 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Sat, 4 Feb 2023 22:43:37 -0500 Subject: [PATCH] Create README - LeetHub --- 119-pascals-triangle-ii/README.md | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 119-pascals-triangle-ii/README.md diff --git a/119-pascals-triangle-ii/README.md b/119-pascals-triangle-ii/README.md new file mode 100644 index 0000000..b5fb956 --- /dev/null +++ b/119-pascals-triangle-ii/README.md @@ -0,0 +1,25 @@ +

119. Pascal's Triangle II

Easy

Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.

+ +

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

+ +

 

+

Example 1:

+
Input: rowIndex = 3
+Output: [1,3,3,1]
+

Example 2:

+
Input: rowIndex = 0
+Output: [1]
+

Example 3:

+
Input: rowIndex = 1
+Output: [1,1]
+
+

 

+

Constraints:

+ + + +

 

+

Follow up: Could you optimize your algorithm to use only O(rowIndex) extra space?

+
\ No newline at end of file