<p>Given an integer <code>numRows</code>, return the first numRows of <strong>Pascal&#39;s triangle</strong>.</p>

<p>In <strong>Pascal&#39;s triangle</strong>, each number is the sum of the two numbers directly above it as shown:</p>
<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif" style="height:240px; width:260px" />
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> numRows = 5
<strong>Output:</strong> [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> numRows = 1
<strong>Output:</strong> [[1]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= numRows &lt;= 30</code></li>
</ul>

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        answer = [[1]]

        for l in range(1, numRows, 1):
            prev_row = answer[-1]
            tmp = []

            for x in range(l + 1):
                if x == 0:
                    tmp.append(prev_row[x])
                elif x == len(prev_row):
                    tmp.append(prev_row[-1])
                else:
                    tmp.append(prev_row[x-1] + prev_row[x])

            answer.append(tmp)
        
        return answer
16000