class Solution:
"""
@param: grid: a list of lists of integers
@return: An integer, minimizes the sum of all numbers along its path
"""
def minPathSum(self, grid):
# write your code here
for i in range(1,len(grid[0])):
grid[0][i]+=grid[0][i-1]
for i in range(1,len(grid)):
grid[i][0]+=grid[i-1][0]
for j in range(1,len(grid[0])):
grid[i][j]+=grid[i][j-1] if grid[i][j-1]<grid[i-1][j] else grid[i-1][j]
return grid[-1][-1]