119. Pascal's Triangle II - LeetCode Solution


Array Dynamic Programming

Python Code:

class Solution:
    def getRow(self, rowIndex: int) -> List[int]:
        a = [[1], [1,1]]
        
        if rowIndex <=1:
            return a[rowIndex]
        
        for i in range(1, rowIndex):
            b = [1]
            
            for j in range(len(a[i])-1):
                b.append(a[i][j]+ a[i][j+1] )
                
            b.append(1)
            a.append(b)
            
        return a[rowIndex]


Comments

Submit
0 Comments
More Questions

287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors