Time: 34 ms (72.35%), Space: 13.8 MB (61.27%) - LeetHub

2026-06-13 14:57:08 +00:00 · 2023-01-31 19:30:57 -05:00
parent 99387f0723
commit 214c5d0b26
1 changed files with 12 additions and 0 deletions
@@ -0,0 +1,12 @@
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        if numRows == 1:
+            return [[1]]
+        
+        triangle = [[1],[1,1]]
+        
+        while len(triangle) < numRows:
+            nextRow = [((triangle[-1][i] + triangle[-1][i - 1]) if (i in range(1,len(triangle[-1]))) else 1) for i in range(len(triangle[-1]) + 1)]
+            triangle.append(nextRow)
+            
+        return triangle