Leetcode - Pascal's Triangle Solution — The Poor Coder

Given an integer numRows, return the first numRows of Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:

Example 1:

Text

Input: numRows = 5
Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]

Example 2:

Text

Input: numRows = 1
Output: [[1]]

Constraints:

1 <= numRows <= 30

Solution in python#

Python

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        triangle = [[1]]
        for _ in range(1,numRows):
            prev_row = triangle[-1]
            row = [1]
            for i in range(1,len(prev_row)):
                row.append(prev_row[i]+prev_row[i-1])
            row.append(1)
            triangle.append(row)
        return triangle

May 112021

Leetcode - Find the Highest Altitude Solution

There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0. You are given an integer array gain of length n where…

leetcode array1 min read

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

May 112021

Leetcode - Average Waiting Time Solution

There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrivali, timei]: arrivali is the arrival time of the ith customer. The arrival times are sorted in non-decreasing order…

leetcode array4 min read

Solution in python#

Related posts

Leetcode - Find the Highest Altitude Solution

Leetcode - Count Good Meals Solution

Leetcode - Average Waiting Time Solution