<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 {
public:
    vector<vector<int>> generate(int numRows) {
    // Initialize the result vector
    vector<vector<int>> result;

    // Generate each row of Pascal's Triangle
    for (int i = 0; i < numRows; ++i) {
        // Create a row with 1s
        vector<int> row(i + 1, 1);

        // Compute the middle values for the current row
        for (int j = 1; j < i; ++j) {
            row[j] = result[i-1][j-1] + result[i-1][j];
        }

        // Add the row to the result
        result.push_back(row);
    }

    return result;
}
    
};
7900