Leetcode 118 Pascal's triangle Solution in java | Hindi Coding Community

 

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

Example 1:

Input: rowIndex = 3

Output: [1,3,3,1]

public class Solution {

    public List<Integer> getRow(int k) {

        Integer[] arr = new Integer[k + 1];

        Arrays.fill(arr, 0);

        arr[0] = 1;

       

        for (int i = 1; i <= k; i++)

            for (int j = i; j > 0; j--)

                arr[j] = arr[j] + arr[j - 1];

       

        return Arrays.asList(arr);

    }

}