刷题训练 day34 | 第九章 动态规划 part02

题目1：【二刷完成】

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i=0;i<m;i++){
            dp[i][0] = 1;
        }
        for (int j=0;j<n;j++){
            dp[0][j] = 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];
    }
}

题目2：【二刷完成】

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int n = obstacleGrid.length;
        int m = obstacleGrid[0].length;
        int[][] dp = new int[n][m];
        if (obstacleGrid[n-1][m-1]==1 || obstacleGrid[0][0]==1){
            return 0;
        }
        for (int i=0;i<n&&obstacleGrid[i][0]==0;i++){
                dp[i][0] = 1;
        }
        for (int j=0;j<m&&obstacleGrid[0][j]==0;j++){
                dp[0][j] = 1;
        }
        for (int i=1;i<n;i++){
            for (int j=1;j<m;j++){
                if (obstacleGrid[i][j]==0){
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }else{
                    dp[i][j] = 0;
                }
            }
        }
        return dp[n-1][m-1];
    }
}