思想:
方法一:DP
类似上一题,这里直接用滚动数组实现。时间复杂度O(n^2),空间复杂度O(n)。
注意初始map[0] = 1,针对map[0],当obstacleGrid[0][j]有1个的等于1时(有障碍),下面所有的map[0]都为0(无路径可达)。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
int m = obstacleGrid.size();
int n =obstacleGrid[0].size();
if(obstacleGrid[0][0]==1 || obstacleGrid[m-1][n-1]==1) return 0;
vector<int> map(n,0);
map[0] = 1;
for(int i=0;i<m;i++) {
for(int j=0;j<n;j++) {
if(obstacleGrid[i][j] == 1) {
map[j] = 0;
}else if(j > 0){
map[j] = map[j-1] + map[j];
}
}
}
return map[n-1];
}
};
方法二:DFS+备忘录
class Solution {
private:
vector<vector<int>> map;
int dfs(vector<vector<int>> &obstacleGrid, int m, int n) {
if(obstacleGrid[m][n] == 1) return 0;
if(m == 0 && n == 0) return 1;
return getOrUpdate(obstacleGrid, m-1, n) + getOrUpdate(obstacleGrid, m, n-1);
}
int getOrUpdate(vector<vector<int>> &obstacleGrid, int m, int n) {
if(m < 0 || n < 0) return 0;
if(map[m][n] > 0) return map[m][n];
else return map[m][n] = dfs(obstacleGrid,m,n);
}
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if(obstacleGrid[0][0] == 1 || obstacleGrid[m-1][n-1] == 1) return 0;
this->map = vector<vector<int>>(m, vector<int>(n,0));
return dfs(obstacleGrid, m-1, n-1);
}
};