【LeetCode】64.最小路径和

64.最小路径和

记录自己的算法：

1.dp：

public static 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-1][j],dp[i][j-1]) + grid[i][j];
                }
            }
        }
        return dp[row-1][col-1];
    }