DP专项训练：leetcode64. 最小路径和

题：

思：
和62、63基本一样，注意矩阵里的数字是可以取0的

public int minPathSum(int[][] grid) {
        int dp[][] = new int[grid.length][grid[0].length];
        int x, y;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                try {
                    x = dp[i][j-1];
                } catch (Exception e) {
                    x = -1;
                }
                try {
                    y = dp[i-1][j];
                } catch (Exception e) {
                    y = -1;
                }
                if(x==-1 && y == -1){
                    dp[i][j] = grid[i][j];
                }
                else if (x == -1) {
                    dp[i][j] = y + grid[i][j];
                } else if (y == -1) {
                    dp[i][j] = x + grid[i][j];
                } else {
                    dp[i][j] = Math.min(x, y) + grid[i][j];
                }
            }
        }
        return dp[dp.length - 1][dp[0].length - 1];
    }