Pascal's Triangle II
Given an integer rowIndex, return the rowIndex^th (0-indexed) row of Pascal's triangle.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Follow up: Could you optimize your algorithm to use only O(rowIndex) extra space?
Example 1
Input
rowIndex = 3Output
[1,3,3,1]The 3rd 0-indexed row of Pascal's triangle is [1, 3, 3, 1].
Example 2
Input
rowIndex = 0Output
[1]The 0th row of Pascal's triangle is [1].
Constraints
- 0 <= rowIndex <= 33