LeetCode 118 Pascal's Triangle

LeetCode 118 Pascal's Triangle Problem

Download Code
class Solution:
    def generate(self, numRows):
        :type numRows: int
        :rtype: List[List[int]]
        result = []
        for i in range(numRows):
            result.append([0] * (i + 1))
        for i in range(numRows):
            for j in range(i + 1):
                if j == 0 or j == i:
                    result[i][j] = 1
                    result[i][j] = result[i - 1][j - 1] + result[i - 1][j]
        return result
Download Pascal's Triangle.py

List of all Pascal's Triangle problems

Leetcode 118 Pascal's Triangle problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.