class Solution {
public int minPathSum(int[][] grid) {
int r = grid.length;
int c = grid[0].length;
int[][] dp = new int[r][c];
//base
dp[0][0] = grid[0][0];
for(int i =1;i<c;i++){
dp[0][i] = dp[0][i-1] + grid[0][i];
}
for(int i = 1;i<r;i++){
dp[i][0] = dp[i-1][0] + grid[i][0];
}
//状态转移
for(int i = 1;i<r;i++){
for(int j = 1;j<c;j++){
dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1]) + grid[i][j];
}
}
return dp[r-1][c-1];
}
}
