leetcode-63. 不同路径 II
题目:
代码:
#include <iostream>
#include <vector>
using namespace std;
int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) {
int m=obstacleGrid.size();
int n=obstacleGrid[0].size();
vector<vector<int> > f(m,vector<int>(n));
f[0][0]=!obstacleGrid[0][0];
for(int i=0;i<n && obstacleGrid[0][i]==0;i++){
f[0][i]=1;
}
for(int i=0;i<m && obstacleGrid[i][0]==0;i++){
f[i][0]=1;
}
for(int i=1;i<m;i++){
for(int j=1;j<n;j++){
if(obstacleGrid[i][j]==1){
f[i][j]=0;
}else{
f[i][j]=f[i-1][j]+f[i][j-1];
}
}
}
return f[m-1][n-1];
}
int main(){
int res;
vector<vector<int> > obstacleGrid;
res=uniquePathsWithObstacles(obstacleGrid);
return 0;
}