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

这道题是 Unique Path 的进阶，在 Unique Path 这道题的基础上增加了障碍的设定，有障碍的方格无法通过，在此基础上再求到达右下角方格的路径数。具体的思路和 Unique Path 是相同的，具体可参照 Unique Path 的做法。

与 Unique Path 不同的地方在于，当遇到有障碍的方格时，即 obstacleGrid[ i ][ j ] 值为 1 时，map[ i ][ j ] 的值应等于 0 .另外，在初始化第一行和第一列时应注意，若在第一行或第一列上有障碍存在时，到达障碍之后方格的唯一路径就被阻断了，障碍和障碍之后的方格值应设为 0。

例如，若 obstaclesGrid 为如下所示：

[
  [0,0,1,0],
  [1,0,0,0],
  [0,0,0,0],
  [0,0,0,0]
]

则对应的map应为：

[
  [1,1,0,0],
  [0,0,0,0],
  [0,0,0,0],
  [0,0,0,0]
]

class Solution {
public:
    int map[100][100];
	
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
    	int m = obstacleGrid.size();
    	int n = obstacleGrid[0].size();
        
        //初始化map
    	int flag = 0;
        for (int i = 0; i < m; i++) {
        	if (obstacleGrid[i][0] == 0 && flag == 0) {
        		map[i][0] = 1;
			} else {
				map[i][0] = 0;
				flag = 1;
			}
		}
		flag = 0;
		for (int i = 0; i < n; i++) {
			if (obstacleGrid[0][i] == 0 && flag == 0) {
        		map[0][i] = 1;
			} else {
				map[0][i] = 0;
				flag = 1;
			}
		}
        
        for (int i = 1; i < m; i++) {
	    	for (int j = 1; j < n; j++) {
	    		if (obstacleGrid[i][j] == 1) {
	    			map[i][j] = 0;
				} else {
					map[i][j] = map[i - 1][j] + map[i][j - 1];
				}
			}
		}
		return map[m - 1][n - 1];
    }
};