<qiyuangong>064_Minimum_Path_Sum_1.py
def minPathSum( grid):
    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])
            pathmap[i][j] = min(compare)
    return pathmap[-1][-1]
def sample_funcname ( var_0 ) :
    var_2 = len ( var_0 )
    if var_2 == 0 :
        return 0
    var_4 = len ( var_0 [ 0 ] )
    var_5 = [ ]
    for var_7 in range ( var_2 ) :
        var_5.append ( [ 100000000000 ] * var_4 )
    var_5 [ 0 ] [ 0 ] = var_0 [ 0 ] [ 0 ]
    for var_7 in range ( var_2 ) :
        for var_10 in range ( var_4 ) :
            var_11 = [ var_5 [ var_7 ] [ var_10 ] ]
            if var_7 - 1 >= 0 :
                var_11.append ( var_5 [ var_7 - 1 ] [ var_10 ] + var_0 [ var_7 ] [ var_10 ] )
            if var_10 - 1 >= 0 :
                var_11.append ( var_5 [ var_7 ] [ var_10 - 1 ] + var_0 [ var_7 ] [ var_10 ] )
            var_5 [ var_7 ] [ var_10 ] = min ( var_11 )
    return var_5 [ - 1 ] [ - 1 ]
