leetcode.com 64. Minimum Path Sum

문제 링크: https://leetcode.com/problems/minimum-path-sum

Author: skysign

leetcode.com 64. Minimum Path Sum/main.py

@@ -0,0 +1,20 @@
+import sys
+from typing import List
+
+
+class Solution:
+    def minPathSum(self, grid: List[List[int]]) -> int:
+        dp = [[sys.maxsize for _ in range(len(grid[0]))] for _ in range(len(grid))]
+        dp[0][0] = grid[0][0]
+
+        for i in range(1, len(grid[0])):
+            dp[0][i] = min(dp[0][i], dp[0][i - 1] + grid[0][i])
+
+        for i in range(1, len(grid)):
+            dp[i][0] = min(dp[i][0], dp[i - 1][0] + grid[i][0])
+
+        for i in range(1, len(grid)):
+            for j in range(1, len(grid[0])):
+                dp[i][j] = min(dp[i][j], dp[i - 1][j] + grid[i][j], dp[i][j - 1] + grid[i][j])
+
+        return dp[len(grid) - 1][len(grid[0]) - 1]