119. Pascal's Triangle II

119. Pascal's Triangle II

class Solution:
    def getRow(self, rowIndex: int) -> List[int]:
        if rowIndex == 0:
            return [1]
        prev = self.getRow(rowIndex - 1)
        curr = []
        for i in range(len(prev) - 1):
            curr.append(prev[i] + prev[i+1])
        return [1] + curr + [1]