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.
我的不能ac的,报
Runtime Error
错误: class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m,n;
m=obstacleGrid.size();
if(m==0)return 0;
n=obstacleGrid[0].size();
if(m==1 and n==1 ){
if(obstacleGrid[0][0]==0){
return 1;
}
if(obstacleGrid[0][0]==1){
return 0;
}
//return 1;
}
vector<vector<int>> vec;
vector<int> tmp;
for(int i=0;i<n;i++)
tmp.push_back(0);
for(int i=0;i<m;i++)
vec.push_back(tmp);
for(int i=n-1;i>=0;i++){
if(obstacleGrid[m-1][i]==0){
vec[m-1][i]=1;
}
else{
for(int j=i;j>=0;j++){
vec[m-1][j]=0;
}
break;
}
}
for(int j=m-1;j>=0;j--){
if(obstacleGrid[j][n-1]==0){
vec[j][n-1]=1;
}
else{
for(int k=j;k>=0;k--){
vec[k][n-1]=0;
}
break;
}
}
for(int i=m-1-1;i>=0;i--){
for(int j=n-1-1;j>=0;j--){
if(obstacleGrid[i][j]==1){
vec[i][j]=0;
}
else{
vec[i][j]=vec[i][j+1]+vec[i+1][j];
}
}
}
return vec[0][0];
}
};
能ac的
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
int m=obstacleGrid.size(),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];
}
};