Pascal's Triangle Generator

Function Name: generatePascalsTriangle

Description

Write a function named 'generatePascalsTriangle' that generates and returns Pascal's triangle up to the 'n-th' level.

Pascal's triangle is a triangular array of the binomial coefficients. Each number is the sum of the two numbers directly above it.

The function should take one integer 'n' as a parameter, which represents the number of levels in the triangle.

The function should return a list of lists, where each inner list represents a level of the triangle.

Requirements

• The function 'generatePascalsTriangle' must have exactly one parameter, an integer 'n'.
• If 'n' is less than or equal to 0, return an empty list.
• Each list within the main list should signify one level of the triangle, starting from the top level (level 0).
• The function should handle up to 10 levels of the triangle but should not handle invalid inputs.

Examples

For example, calling 'generatePascalsTriangle(3)' should return the following lists:[[1], [1, 1], [1, 2, 1], [1, 3, 3, 1]].As another example, calling 'generatePascalsTriangle(1)' should return [[1], [1, 1]].

Links