经典的dp , 只是障碍物要单独处理下。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m(obstacleGrid.size()), n(obstacleGrid[0].size());
vector<vector<long int>>res(m, vector<long int>(n,0));
for(int i = 0; i < m; i++){
if(obstacleGrid[i][0] == 1) break;
else res[i][0] = 1;
}
for(int i = 0; i < n; i++){
if(obstacleGrid[0][i] == 1) break;
else res[0][i] = 1;
}
for(int i = 1; i < m; i++)
for(int j = 1; j < n; j++){
if(obstacleGrid[i][j] == 1) res[i][j] = 0;
else
res[i][j] = res[i-1][j] + res[i][j-1];
}
return res[m-1][n-1];
}
};