def min_path_sum(grid): for i in range(1,len(grid)): grid[0][i] += grid[0][i-1] grid[i][0] += grid[i-1][0] for i in range(1, len(grid)): for j in range(1, len(grid)): grid[i][j] += min(grid[i][j-1], grid[i-1][j]) return grid[-1][-1]
chch_oi
def min_path_sum(grid): for i in range(1,len(grid)): grid[0][i] += grid[0][i-1] grid[i][0] += grid[i-1][0] for i in range(1, len(grid)): for j in range(1, len(grid)): grid[i][j] += min(grid[i][j-1], grid[i-1][j]) return grid[-1][-1]