//leetcode submit region begin(Prohibit modification and deletion)

class Solution {

public int minPathSum(int[][] grid) {

int row = grid.length;

int col = grid[0].length;

int[][] dp = new int[row][col];

for(int i = 0; i < row; i++) {

for(int j = 0; j < col; j++) {

if(i == 0 && j == 0) {

dp[i][j] = grid[i][j];

} else if(i == 0) {

dp[i][j] = dp[i][j - 1] + grid[i][j];

} else if(j == 0) {

dp[i][j] = dp[i - 1][j] + grid[i][j];

} else {

dp[i][j] = Math.min(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];

}

}

}

return dp[row - 1][col - 1];

}

}

//leetcode submit region end(Prohibit modification and deletion)

public static void main(String[] args) {

Solution solution = new MinimumPathSum().new Solution();

}

}