class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
if(obstacleGrid.empty()) return 0;
if(obstacleGrid[0].empty()) return 0;
if(obstacleGrid[0][0]==1) return 0;
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
int dp[m][n];
dp[0][0] = 1;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(i==0&&j==0) continue;
if(obstacleGrid[i][j]==1) dp[i][j] = 0;
else{
dp[i][j] = 0;
if(i-1>=0) dp[i][j] += dp[i-1][j];
if(j-1>=0) dp[i][j] += dp[i][j-1];
}
}
}
return dp[m-1][n-1];
}
};
使用递归会超时,所以选择动态规划。