add: dijkstra

2026-06-05 15:39:29 +08:00 · 2020-06-27 09:07:35 +08:00
parent a798d3272b
commit 99631c82e9
15 changed files with 77 additions and 39 deletions
@@ -45,7 +45,6 @@ class Solution:
        for j in range(n - 2, -1, -1):
            grid[m - 1][j] += grid[m - 1][j + 1]

-        
        for i in range(m - 2, -1, -1):
            for j in range(n - 2, -1, -1):
                grid[i][j] += min(grid[i + 1][j], grid[i][j + 1])