<ul><li>Input: 5</li><li>Output:</li><li>[</li><li>     [1],</li><li>    [1,1],</li><li>   [1,2,1],</li><li>  [1,3,3,1],</li><li> [1,4,6,4,1]</li><li>]</li><li>In each row, the first and last element are 1. And the other element is the sum of the two elements in the previous row.</li><li>This problem can be solved by iterating through each row and calculating each element in the row as the sum of the corresponding elements in the previous row.</li><li>The given code snippet demonstrates the solution in C++.</li></ul>

Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle.

Discover more