Package g0101_0200.s0119_pascals_triangle_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    119 - Pascal's Triangle II\.

    Easy

    Given an integer rowIndex, return the <code>rowIndex<sup>th</sup></code> ( 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 &lt;= rowIndex &lt;= 33

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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

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

      • Methods inherited from class java.lang.Object

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