LC 119 Pascals Triangle Ii

Implementation

// 119. Pascal's 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:
// 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

const getRow = (rowIndex) => {
    if(rowIndex ===0 ) return [1]
    const res = [];
    for(let i=0;i<=rowIndex;i++){
        const row = new Array(i+1).fill(1);
        for(let j=1;j<i;j++){
            row[j]=res[i-1][j-1]+res[i-1][j];
        }
        res.push(row);
    }
    return res[rowIndex];
};

console.log(getRow(3))
console.log(getRow(0))
console.log(getRow(1))

export { getRow }

Tests

// Test stub for 02.119.Pascal'sTriangle II

describe('02.119.Pascal'sTriangle II', () => {
  it('should have a test stub', () => {
    expect(true).toBe(true);
  });
});