Time: 35 ms (56.96%), Space: 13.9 MB (12.45%) - LeetHub

2026-06-13 14:57:08 +00:00 · 2023-02-04 22:43:40 -05:00
parent 1f6f870df0
commit dd86b3603a
1 changed files with 16 additions and 0 deletions
@@ -0,0 +1,16 @@
+class Solution:
+    def getRow(self, rowIndex: int) -> List[int]:
+        def combination(n: int, r: int) -> int:
+            # n! / (n - r)!
+            numerator = 1
+            for i in range(n - r + 1, n + 1):
+                numerator *= i
+                
+            # 1 / r!
+            divisor = 1
+            for j in range(2, r + 1):
+                divisor *= j
+            
+            return int(numerator / divisor)
+        
+        return [ combination(rowIndex, i) for i in range(rowIndex + 1) ]