---
title: "119. Pascal's Triangle II"
url: "https://laigary.com/interview/coding/119-pascals-triangle-ii"
type: "note"
section: "coding"
date: "2023-10-31"
updated: "2023-11-01"
tags: ["Recursion", "Array"]
---

# 119. Pascal's Triangle II

[119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)  

```python
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]
```