unique paths solution

Author: devyejin

unique-paths/devyejin.py

@@ -0,0 +1,11 @@
+# 시간 복잡도 O(mn), 공간복잡도 O(mn)
+class Solution:
+    def uniquePaths(self, m: int, n: int) -> int:
+        dp = [[1] * n for _ in range(m)]
+
+        for i in range(1, m):
+            for j in range(1, n):
+                dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
+
+        return dp[m - 1][n - 1]
+