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
.
依然是动态规划的题,和之前的Unique Paths I差不多。不过每次使用dp数组的时候需要判断是否有obstacle,这个我们申请m+1,n+1大小的二维数组,这样避免了第0行、列的判断赋值。将初始起点后移到0,1这样就可以将所有点都当作一样的点来操作,去除了边的特殊性。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int>> dp(m+1,vector<int>(n+1,0));
dp[0][1] = 1;
for(int i=1;i<=m;i++){
for(int j=1; j<=n;j++){
if(!obstacleGrid[i-1][j-1]){
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
}
return dp[m][n];
}
};