算法练习第三十九天|62.不同路径、63. 不同路径 II

62.不同路径

class Solution {
    public int uniquePaths(int m, int n) {

        //dp[i][j]含义是走到这里有多少路径

        //推导公式
        //dp[i][j] = dp[i-1][j] + dp[i][j-1]

        //初始化
        //dp[0][j]=1
        //dp[i][0]=1


        int[][] dp = new int[m][n];
        for(int i = 0;i<m;i++){
            dp[i][0] =1;
        }
        for(int i = 0;i<n;i++){
            dp[0][i] =1;
        }


        for(int i =1;i<m;i++){
            for(int j =1;j<n;j++){
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }

        return dp[m-1][n-1];

    }
}

63. 不同路径 II

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];

        if(obstacleGrid[0][0] == 1|| obstacleGrid[m-1][n-1] ==1){
            return 0;
        }


        //初始化
        for(int i =0 ;i<m && obstacleGrid[i][0]==0;i++){
            dp[i][0] = 1;
        }
        for(int j = 0;j<n && obstacleGrid[0][j]==0;j++){
            dp[0][j] = 1;
        }

        for(int i =1;i<m;i++){
            for(int j = 1;j<n;j++){
                if(obstacleGrid[i][j] == 0){
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }
            }
        }


        return dp[m-1][n-1];
    }
}