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 Paths的少许变化，如果利用的是DFS 只需减枝即可。对于dp来说相应的地方置0即可。具体位置见代码！

    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        
    int m = obstacleGrid.size();
    int n = obstacleGrid[0].size(); 
    vector<vector<int>> dp(m,vector<int>(n,0));//dp[][]
	for (int i = 0;i < n;i++) // 行号为0，列元素当碰到障碍物后面所有路径均不可达，全为0
	{
	    if(!obstacleGrid[0][i]) 
		dp[0][i] = 1;
		else
		{
		    for(int j = i;j < n;j++)
		    {
		        dp[0][j] = 0;
		    }
		    break;
		}
	}

	for (int i = 0;i < m;i++)// 列号为0，行元素当碰到障碍物后面所有路径均不可达，全为0
	{
	    if(!obstacleGrid[i][0])
		dp[i][0] = 1;
		else
		{
		    for(int j = i;j < m;j++)
		    {
		        dp[j][0] = 0;
		    }
		    break;
		}
	}

	for (int i = 1;i < m;i ++)
	{
		for (int j = 1;j < n;j++)
		{
		    if(obstacleGrid[i][j])//障碍物处表明不可达，为0！
		    {
		       dp[i][j] = 0; 
		    }
		    else
		    {
			    dp[i][j] = dp[i-1][j] + dp[i][j-1];
		    }
		}
	}

	return dp[m-1][n-1];
    }