🌗 63. 不同路径 II

难度: 🌗

• 问题描述
• 解法
• 输出

问题描述

---

解法

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        // 思路：
        // dp[i][j] = dp[i - 1][j] + dp[i][j - 1], 0
        int row = obstacleGrid.length;
        int col = obstacleGrid[0].length;
        int[][] dp = new int[row][col];
        for(int i = 0; i < row; i ++) {
            if(obstacleGrid[i][0] != 1) {
                dp[i][0] = 1;
            } else {
                break;
            }
        }
        for(int j = 0; j < col; j ++) {
            if(obstacleGrid[0][j] != 1) {
                dp[0][j] = 1;
            } else {
                break;
            }
        }
        for(int i = 1; i < row; i ++) {
            for(int j = 1; j < col; j ++) {
                if(obstacleGrid[i][j] != 1) {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[row - 1][col - 1];
    }
}

---

输出