Feat : Unique Paths

Author: printjin-gmailcom

unique-paths/printjin-gmailcom.py

@@ -0,0 +1,7 @@
+class Solution:
+    def uniquePaths(self, m, n):
+        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]