LeetCode63 Unique Paths II 寻找不同路径II

题目描述：
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).

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.

Note: m and n will be at most 100.

Example 1:

Input:
[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]
Output: 2

Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right
题源：here；完整实现：here
思路：
同第62题一样，我们只要将有障碍的地方置零即可，代码如下：

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

        return dp[m - 1][n - 1];}};

贴出运行结果纪念一下：