原题:
解决方法:
在62. Unique Paths的基础上,需要加上对数值为1的点的处理,当数值为1时,路径数肯定是0。其他推导公式不变。
代码:
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.
在62. Unique Paths的基础上,需要加上对数值为1的点的处理,当数值为1时,路径数肯定是0。其他推导公式不变。
代码:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
if (obstacleGrid.empty() || obstacleGrid[0].empty())
return 0;
int m = obstacleGrid.size(), n = obstacleGrid[0].size();
vector<vector<int>> dp(m, vector<int>(n, 0));
for(int i = 0; i < m && !obstacleGrid[i][0]; i++){
dp[i][0] = 1;
}
for(int j = 0; j < n && !obstacleGrid[0][j]; j++){
dp[0][j] = 1;
}
for(int i = 1; i < m; i++){
for(int j = 1; j < n; j++){
if (obstacleGrid[i][j] == 1){
dp[i][j] = 0;
}else{
dp[i][j] = dp[i-1][j]+dp[i][j-1];
}
}
}
return dp[m-1][n-1];
}