Breaking News: Grepper is joining You.com. Read the official announcement!

Min Path Sum DP

Siddhant Medar answered on July 17, 2022 Popularity 5/10 Helpfulness 1/10

answer Min Path Sum DP

Min Path Sum DP

Comment

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        # Memoization
        def solve(i,j):
            if i == m-1 and j == n-1:
                return grid[i][j]
            
            if i>=m or j>=n:
                return float("inf")
                
            if dp[i][j] != -1:
                return dp[i][j]
            
            dp[i][j] = grid[i][j]+min(solve(i+1,j), solve(i,j+1))
            
            return dp[i][j]
        
        m,n = len(grid), len(grid[0])
        dp = [[-1 for _ in range(n)] for _ in range(m)]
        
        return solve(0,0)
    
    
        #Tabulation    
        def solve2():
            m,n = len(grid), len(grid[0])
            dp = [[-1 for _ in range(n)] for _ in range(m)]
            
            dp[m-1][n-1] = grid[m-1][n-1]
            
            for i in range(m-1,-1,-1):
                for j in range(n-1,-1,-1):
                    if i == m-1 and j == n-1:
                        continue
                        
                    down = dp[i+1][j] if 0<=i+1<m and 0<=j<n else float("inf")
                    right = dp[i][j+1] if 0<=i<m and 0<=j+1<n else float("inf")
                    dp[i][j] = grid[i][j]+min(down, right)
            
            return dp[0][0]
        
        return solve2()

Popularity 5/10 Helpfulness 1/10 Language python

Source: leetcode.com

Tags: min path python sum

Link to this answer
Share Copy Link

Contributed on Jul 17 2022

Siddhant Medar

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Min Path Sum DP

Contents

More Related Answers

Min Path Sum DP

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.