Go /Golang solution


  • 0
    D
    func minPathSum(grid [][]int) int {
        var m int = len(grid)
        var n int = len(grid[0])
        for i := 1; i < m; i++{
        	grid[i][0] += grid[i-1][0];
        }
        for j := 1; j < n; j++{
            grid[0][j] += grid[0][j-1];
        }
        for i:= 1; i < m; i++{
            for j:=1; j<n; j++{
                grid[i][j] += min(grid[i-1][j], grid[i][j-1]);
            }
        }
        return grid[m-1][n-1];
        
    }
    func min(a, b int) int {
        if a < b {
            return a
        }
        return b
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.