力扣第六十三题（不同路径II）详解

思路其实和前一题一样，只不过加上了判断是否有障碍的条件，这道题和经典的过河卒问题一样，下面附上代码：

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int n = obstacleGrid.size();
        int m = obstacleGrid[0].size();
        vector<vector<int>> dp(n,vector<int>(m,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])continue;//判断是否有障碍，如果有则跳过
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[n - 1][m - 1];
    }
};