63. Unique Paths II Medium

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

思路：使用动态规划，到最后一个点的路径个数等于他上面的点和左面的点的路径之和。注意如果遇到1的情况直接将路径数设为0。用result[i][j]记录数组中行列为i，j的点的路径数。关系式:result[i][j] = result[i - 1][j] + result[i][j - 1].

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