Unique Paths II - LeetCode

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

思路：DP。

我们用dp[i][j]表示到达matrix[i][j]的全部可能路线数。则当matrix[i][j] = 0,即当前位置没有障碍时，dp[i][j] = dp[i - 1][j] + dp[i][j - 1]；否则dp[i][j] = 0。

因此我们有递推公式：dp[i][j] = (1 - matrix[i][j]) * (dp[i - 1][j] + dp[i][j - 1]);

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        if (m == 0) return 0;
        int n = obstacleGrid[0].size();
        if (n == 0) return 0;
        vector<int> tem(n, 0);
        vector<vector<int> > dp(m, tem);
        dp[0][0] = 1 - obstacleGrid[0][0];
        for (int i = 1; i < m; i++)
            dp[i][0] = (1 - obstacleGrid[i][0]) * dp[i - 1][0];
        for (int i = 1; i < n; i++)
            dp[0][i] = (1 - obstacleGrid[0][i]) * dp[0][i - 1];
        for (int i = 1; i < m; i++)
            for (int j = 1; j < n; j++)
                dp[i][j] = (1 - obstacleGrid[i][j]) *
                    (dp[i - 1][j] + dp[i][j - 1]);
        return dp[m - 1][n - 1];
    }
};