LeetCode 064 Minimum Path Sum

LeetCode 064 Minimum Path Sum Problem

Download Code
class Solution(object):
    def minPathSum(self, grid):
        :type grid: List[List[int]]
        :rtype: int
        height = len(grid)
        if height == 0:
            return 0
        width = len(grid[0])
        pathmap = []
        for i in range(height):
            pathmap.append([100000000000] * width)
        pathmap[0][0] = grid[0][0]
        for i in range(height):
            for j in range(width):
                compare = [pathmap[i][j]]
                if i - 1 >= 0:
                    compare.append(pathmap[i - 1][j] + grid[i][j])
                if j - 1 >= 0:
                    compare.append(pathmap[i][j - 1] + grid[i][j])
                # min choice
                pathmap[i][j] = min(compare)
        return pathmap[-1][-1]
Download Minimum Path Sum.py

List of all Minimum Path Sum problems

Leetcode 064 Minimum Path Sum problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.