算法随想录算法训练营第三十四天|62.不同路径 63. 不同路径 II

62.不同路径 

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        dp[0][0] = 1;
        for(int i =1;i<n;i++){
            dp[0][i] = 1;
        }
        for(int i =1;i<m;i++){
            dp[i][0] = 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 k = obstacleGrid.length;//表示宽
        int c = obstacleGrid[0].length;//表示长
        int[][] dp = new int[k][c];
        for(int i = 0;i<c;i++){
            if(obstacleGrid[0][i]!=1)
                dp[0][i] = 1; 
            else
                break;
        }
        for(int i =0;i<k;i++){
            if(obstacleGrid[i][0]!=1)
                dp[i][0] = 1;
            else
                break;
        }
        for(int i = 1;i<k;i++){
            for(int j = 1;j<c;j++){
                if(obstacleGrid[i][j] == 1){
                    dp[i][j] = 0;
                }else{
                    dp[i][j] = dp[i-1][j]+dp[i][j-1];
                }
            }
        }
        return dp[k-1][c-1];
    }
}