[Leetcode] 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.

思路：DP，和unique path I 大同小异，转移方程 f[i][j] = f[i-1][j] + f[i][j-1]，但是遇到obstacle需要赋值为0. 同时需要首先将第一行第一列赋值为1.

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        if (obstacleGrid.size() <= 0) return 0;
        int width = (int)obstacleGrid.size();
        int length = (int)obstacleGrid[0].size();
        vector<vector<int>> paths(width, vector<int>(length, 0));
        for (int i = 0; i < width; ++i) {
            if (obstacleGrid[i][0] == 1) break;
            paths[i][0] = 1;
        }
        for (int j = 0; j < length; ++j) {
            if (obstacleGrid[0][j] == 1) break;
            paths[0][j] = 1;
        }
        for (int i = 1; i < width; ++i) {
            for (int j = 1; j < length; ++j) {
                if (obstacleGrid[i][j] == 1) {
                    paths[i][j] = 0;
                } else {
                    paths[i][j] = paths[i-1][j] + paths[i][j-1];
                }
            }
        }
        return paths[width-1][length-1];
    }
};

总结：复杂度为O(mn).