1class Solution {2    public int minPathSum(int[][] grid) {3        int m = grid.length, n = grid[0].length;4        int[][] dp = new int[m][n];5        for (int r = 0; r < m; r++) {6            for (int c = 0; c < n; c++) {7                if (r == 0 && c == 0) dp[r][c] = grid[r][c];8                else if (r == 0) dp[r][c] = grid[r][c] + dp[r][c - 1];9                else if (c == 0) dp[r][c] = grid[r][c] + dp[r - 1][c];10                else dp[r][c] = grid[r][c] + Math.min(dp[r - 1][c], dp[r][c - 1]);11            }12        }13        return dp[m - 1][n - 1];14    }15}