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.
int uniquePathsWithObstacles(vector<vector<int> > &vec)
{
int f[101][101];
for (int i = 0; i < 101; ++i)
{
for (int j = 0;j < 101; ++j)
{
f[i][j] = 0;
}
}
int m = vec.size();
int n = vec[0].size();
for (int i = 1; i <= m; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (vec[i-1][j-1] == 0)
{
f[i][j] = f[i-1][j] + f[i][j-1];
if (i == 1 && j == 1)
{
f[i][j] = 1;
}
}
else
{
f[i][j] = 0;
}
}
}
return f[m][n];
}