Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.6 MB (55.36%)

Author: jimit105

0118-pascals-triangle/solution.py

@@ -1,18 +1,23 @@
-# Approach 1 - Dynamic Programming (Iterative)
+# Appraoch 1: Dynamic Programming
+
+# Time: O(numRows ^ 2)
+# Space: O(1)
 
 class Solution:
     def generate(self, numRows: int) -> List[List[int]]:
         triangle = []
-        
+
         for row_num in range(numRows):
             row = [None for _ in range(row_num + 1)]
-            
+            # The first and last row elements are always 1.
             row[0], row[-1] = 1, 1
-            
+
+            # Each triangle element is equal to the sum of the elements
+            # above-and-to-the-left and above-and-to-the-right.
             for j in range(1, len(row) - 1):
                 row[j] = triangle[row_num - 1][j - 1] + triangle[row_num - 1][j]
-                
+
             triangle.append(row)
-            
+
         return triangle