1 题目
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).
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.
Note: m and n will be at most 100.
2 尝试解
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<long> path (n,1);
int first_obstacle_bottom = -1;
for(int i = n - 1; i >= 0; i--){ //first check the bottom line,if the grid has obstacle on the right, then there will be no method to the finish,else there is only one
if(first_obstacle_bottom == -1 && obstacleGrid[m-1][i] == 1){
path[i] = 0;
first_obstacle_bottom = i;
}
if(i <= first_obstacle_bottom){
path[i] = 0;
}
}
//if Grid[i][j] is blocked, there will be no method to finish,else Grid[i][j] = Grid[i+1][j]+Grid[i][j+1]
for(int i = 1; i < m; i++){
for(int j = 0; j < n; j++){
if(obstacleGrid[m-1-i][n-1-j] == 1){
path[n-1-j] = 0;
}
else if(j > 0){
path[n-1-j] += path[n-j];
}
}
}
return path[0];
}
};
3 标准解
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];
}
};