63. Unique Paths II

63. Unique Paths II

---

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.

题目大意

本题在62. Unique Paths的基础上，给地图增加了障碍。起点在左上角，终点在右上角，依然是寻找所有可能的路径总数。

解题思路

使用动态规划的思路，每个位置的等于其上方位置和左方位置的路径总数之和。
当遇到障碍位置时，将该点位置的统计量设为0。
PS: 需要考虑上边界和所左边界问题。

算法复杂度

$O(n^2)$

代码实现

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int row = obstacleGrid.size();
        int col = obstacleGrid[0].size();
        if (row == 0 || col == 0) { return 0; }
        vector<vector<int> > countGrid(row, vector<int>(col, 1));
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                if (obstacleGrid[i][j] == 1) {
                    countGrid[i][j] = 0;
                    continue;
                }
                if (i > 0 && j > 0) {
                    countGrid[i][j] = countGrid[i-1][j] + countGrid[i][j-1];
                } else if (i > 0) {
                    countGrid[i][j] = countGrid[i-1][j];
                } else if (j > 0) {
                    countGrid[i][j] = countGrid[i][j-1];
                }
            }
        }
        return countGrid[row-1][col-1];
    }
};