class Solution(object):
def minPathSum(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
m = len(grid)
n = len(grid[0])
dp = [[0 for j in range(n)] for i in range(m)]
dp[0][0] = grid[0][0]
if n > 1:
dp[0][1] = grid[0][1]+grid[0][0]
if m > 1:
dp[1][0] = grid[1][0]+grid[0][0]
for i in range(1, m):
dp[i][0] = dp[i-1][0]+grid[i][0]
for j in range(1, n):
dp[0][j] = dp[0][j-1]+grid[0][j]
for i in range(1, m):
for j in range(1, n):
if i != 0 or j != 0:
dp[i][j] = min(dp[i-1][j], dp[i][j-1])+grid[i][j]
elif i == 0 and j != 0:
dp[i][j] = dp[i][j-1]+grid[i][j]
print("第", i, j, "点位", dp[i][j])
elif i != 0 and j == 0:
dp[i][j] = dp[i-1][j]+grid[i][j]
# print("第", i, j, "点位", dp[i][j])
return (dp[m-1][n-1])