Package g0101_0200.s0119_pascals_triangle_ii

Class Solution

java.lang.Object

g0101_0200.s0119_pascals_triangle_ii.Solution

public class Solution
extends Object

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:** * `0 <= rowIndex <= 33` **Follow up:** Could you optimize your algorithm to use only `O(rowIndex)` extra space?

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	getRow(int rowIndex)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

getRow

public List<Integer> getRow(int rowIndex)