15 Jun 2024•C++ / Python / TypeScript•Easy

Pascal's Triangle II

Collected C++, Python, TypeScript solutions for pascal's triangle ii. Add a dedicated write-up later if you want deeper notes.

View original LeetCode question

auto-generated entry for Pascal's Triangle II. the solution files are available below.

solution files

C++ pascals-triangle-ii/synced-solution.cpp
Python pascals-triangle-ii/synced-solution.py
TypeScript pascals-triangle-ii/synced-solution.ts

Solution files

Python•pascals-triangle-ii/synced-solution.py

class Solution:
    def getRow(self, rowIndex: int) -> List[int]:
        row = [class="syntax-number">1]
        for i in range(rowIndex):
            row = [class="syntax-number">1] + [row[j] + row[j + class="syntax-number">1] for j in range(len(row) - class="syntax-number">1)] + [class="syntax-number">1]
        return row

C++•pascals-triangle-ii/synced-solution.cpp

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> row(rowIndex + class="syntax-number">1, class="syntax-number">1);
        for (int i = class="syntax-number">1; i <= rowIndex; i++) {
            for (int j = i - class="syntax-number">1; j > class="syntax-number">0; j--) {
                row[j] = row[j] + row[j - class="syntax-number">1];
            }
        }
        return row;
    }
};

TypeScript•pascals-triangle-ii/synced-solution.ts

function getRow(rowIndex: number): number[] {
    const row = new Array(rowIndex + class="syntax-number">1).fill(class="syntax-number">1);
    for (let i = class="syntax-number">1; i <= rowIndex; i++) {
        for (let j = i - class="syntax-number">1; j > class="syntax-number">0; j--) {
            row[j] = row[j] + row[j - class="syntax-number">1];
        }
    }
    return row;
}