LeetCode 63. Unique Paths II

https://leetcode.com/problems/unique-paths-ii/

比http://blog.csdn.net/u011026968/article/details/50582964  多一步 就是有障碍的地方有0种方法

const int SIZE = 101;
class Solution {
public:
int uniquePathsWithObstacles(vector< vector<int> >& obstacleGrid) {
//if(obstacleGrid.size() )
for(int i=0;i<obstacleGrid.size();i++)
for(int j=0;j<obstacleGrid[0].size();j++) {
if(obstacleGrid[i][j] == 1) {
dp[i][j] = 0;
continue;
}
if(i == 0 && j == 0) dp[i][j] =1;
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[obstacleGrid.size()-1][obstacleGrid[0].size()-1];
}
private :
int dp[SIZE][SIZE];
};