解法:动态规划
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m=obstacleGrid.size();
int n=obstacleGrid[0].size();
if(obstacleGrid[0][0]==1) return 0; //起始点为障碍
long long dp[m][n]={0}; //int结果太大会溢出
dp[0][0]=1;
for(int i=1;i<m;i++){
dp[i][0]=dp[i-1][0] && (obstacleGrid[i][0]==0);
}
for(int i=1;i<n;i++){
dp[0][i]=dp[0][i-1] && (obstacleGrid[0][i]==0);
}
for(int i=1;i<m;i++){
for(int j=1;j<n;j++){
if(obstacleGrid[i][j]==0)
dp[i][j]=dp[i-1][j]+dp[i][j-1];
else
dp[i][j]=0;
}
}
return dp[m-1][n-1];
}
};