0119. Pascal's Triangle II
Last updated
Was this helpful?
Last updated
Was this helpful?
https://leetcode.com/problems/pascals-triangle-ii
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:
Example 2:
Example 3:
Constraints:
0 <= rowIndex <= 33
Follow up: Could you optimize your algorithm to use only O(rowIndex) extra space?
