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.
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
if(obstacleGrid.size() > 0 && obstacleGrid[0].size() > 0)
{
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if(0 == obstacleGrid[0][0] && 0 == obstacleGrid[m - 1][n - 1])
{
vector<vector<int> > matrix(obstacleGrid);
for(int i = 0; i < m; ++i)
for(int j = 0; j < n; ++j)
matrix[i][j] *= -1;
for(int i = 0; i < n; ++i)
{
if(-1 == matrix[0][i])
while(++i < n) matrix[0][i] = -1;
else
matrix[0][i] = 1;
}
for(int i = 0; i < m; ++i)
{
if(-1 == matrix[i][0])
while(++i < m) matrix[i][0] = -1;
else
matrix[i][0] = 1;
}
for(int i = 1; i < m; ++i)
for(int j = 1; j < n; ++j)
{
if(-1 == matrix[i][j])
continue;
else if(matrix[i-1][j] >= 0 && matrix[i][j-1] >= 0)
matrix[i][j] = matrix[i-1][j] + matrix[i][j-1];
else
matrix[i][j] = max(matrix[i-1][j], matrix[i][j-1]);
}
return matrix[m-1][n-1] >= 0? matrix[m-1][n-1]: 0;
}
}
return 0;
}
};