### 解题思路
在62题的基础上加上了判断每一个格子能不能走
还是62题的做法,把不能走的格子置为0即可
### 代码
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size(),n = obstacleGrid[0].size();
if(m == 0 && n == 0) return 0;
vector<vector<int>> dp(m,vector<int>(n,0));
//状态转移
for(int i = 0; i < m; ++i){
for(int j = 0; j < n; ++j){
if(obstacleGrid[i][j] == 1){
dp[i][j] = 0;
}else{
if(i == 0 && j == 0) dp[i][j] = 1;
else if(i == 0) dp[i][j] = dp[i][j-1];
else if(j == 0) dp[i][j] = dp[i-1][j];
else dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
}
return dp[m-1][n-1];
}
};