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.

思路：这道题与Unique Path I目的差不多，只不过在网格上多个阻碍物，用动态规划状态转移方程依旧没变: P[i][j] = P[i-1][j] + P[i][j-1].其中P[i][j]代表到达点(i,j)的路径数。不同的是要对第一行和的第一列先进行处理。算法实现如下：

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int row = obstacleGrid.size(), col = obstacleGrid[0].size();
        vector<vector<int> > path(row, vector<int>(col, 0));

        if (!obstacleGrid[0][0]) path[0][0] = 1;
        for (int i = 1; i < row; i++) {
            if (!obstacleGrid[i][0]) path[i][0] = path[i-1][0];
        }

        for (int j = 1; j < col; j++) {
            if (!obstacleGrid[0][j]) path[0][j] = path[0][j-1];
        }

        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                if (!obstacleGrid[i][j]) path[i][j] = path[i-1][j] + path[i][j-1];
            }
        }
        return path[row-1][col-1];
    }
};

算法时间复杂度和空间复杂度均为O(row*col)。