problem:
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.
和上一题类似,只是需要多考虑被阻隔的各种情况,1.对于第一行和第一列,只要前面有一个被阻隔,后面都应该改为0;
2.对于中间的,如果当前位置被阻隔,也要改为0.
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int> > result(m, vector<int>(n,1));
int flagrow=0;
for(int i=0; i<m; i++)
{
if((1 == obstacleGrid[i][0]) && (0 == flagrow))
{
result[i][0] = 0;
flagrow = 1;
}
if(1 == flagrow)
result[i][0] = 0;
}
int flagcol=0;
for(int j=0; j<n; j++)
{
if((1 == obstacleGrid[0][j]) && (0 == flagcol))
{
result[0][j] = 0;
flagcol = 1;
}
if(1 == flagcol)
result[0][j] = 0;
}
for(int i=1; i<m; i++)
{
for(int j=1; j<n; j++)
{
result[i][j] = 0;
if(obstacleGrid[i-1][j] != 1)
result[i][j] += result[i-1][j];
if(obstacleGrid[i][j-1] != 1)
result[i][j] += result[i][j-1];
if(1 == obstacleGrid[i][j])
result[i][j] = 0;
}
}
return result[m-1][n-1];
}
};