[leetcode 063]Unique Paths II 解题报告

63. Unique Paths II

---

Problem

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,0,0],
  [0,0,0]
]
The total number of unique paths is 2.

Note: m and n will be at most 100.

---

问题

“Unique Paths”问题延伸：
如果考虑给网格中添加障碍物，有多少种不同路径？
障碍物和空白网格分别用1和0标记。
例如：
3x3格网中间有一个障碍物，如下所示：

[
  [0,0,0],
  [0,0,0],
  [0,0,0]
]
一共有2条不同的路径。

Note： m、n不超过100。

---

思路

加入障碍物之后，不能再用组合的方式求解，只能用动态规划法。与‘Unique Paths ’的不同之处是，当前位置是障碍物时，到达此处的路径数为0。与Unique Paths解法类似，只是在计算出当前路径数时，如果为障碍物，置为0，否则计算当前路径数（可以利用异或运算取代判断语句，如1^1=0,0^1=1）。

---

代码（C++）

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

运行结果