Pascal's Triangle II

Given an index k, return the kth row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

Note:

Could you optimize your algorithm to use only O(k) extra space?

Tags

Array

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

DP Solution

/**
 * @param {number} rowIndex
 * @return {number[]}
 */
// Solution 1
var getRow = function (rowIndex) {
    var f = [[]];

    //Initialization
    for (var i = 0; i <= rowIndex; i++) {
        for (var j = 0; j <= rowIndex; j++) {
            if (j === 0 || i === j) {
                // Javacript dont have the two dimensional array definition
                // All it has is an array of an array
                if (!f[i]) {
                    f[i] = [];
                }
                f[i][j] = 1;
            }
        }
    }

    //Formula
    for (var ii = 1; ii <= rowIndex; ii++) {
        for (var jj = 1; jj < ii; jj++) {
            f[ii][jj] = f[ii - 1][jj - 1] + f[ii - 1][jj];
        }
    }

    return f[rowIndex];
};

Solution 2

Follow up solution, using only space k

 * @param {number} rowIndex
 * @return {number[]}
 */
var getRow = function (rowIndex) {
    if (rowIndex === 0) {
        return [1];
    }

    var lastLevel = [1];
    while (rowIndex > 0) {
        var currentLevel = [];
        currentLevel.push(1);
        for (var i = 0; i < lastLevel.length - 1; i++) {
            currentLevel.push(lastLevel[i] + lastLevel[i + 1]);
        }
        currentLevel.push(1);
        rowIndex--;
        lastLevel = currentLevel;
    }

    return lastLevel;
};