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 都使用的迭代形式的动态规划,只不过限制条件多了一点。也可以使用递归,代码相对麻烦一点。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if(m == 0 || n == 0 || obstacleGrid[m - 1][n - 1] == 1) return 0;
int dp[100][100];
memset(dp, 0, sizeof(int) * 100 * 100);
int flag = 0;
for(int i = 0; i < m; i++) {
if(flag == 1) break;
if(obstacleGrid[i][0] == 0) {
dp[i][0] = 1;
} else {
flag = 1;
}
}
flag = 0;
for(int j = 0; j < n; j++) {
if(flag == 1) break;
if(obstacleGrid[0][j] == 0) {
dp[0][j] = 1;
} else {
flag = 1;
}
}
for(int i = 1; i < m; i++) {
for(int j = 1; j < n; j++) {
if(!obstacleGrid[i - 1][j]) dp[i][j] += dp[i - 1][j];
if(!obstacleGrid[i][j - 1]) dp[i][j] += dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};