Unique Paths II(from leetcode
题意:
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1
and 0
respectively in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
[ [0,0,0], [0,1,0], [0,0,0] ]
The total number of unique paths is 2
.
Note: m and n will be at most 100.
分析:
因为加入不能走的点,所以只能用动态规划,不能用排列组合。
代码:
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
int m = obstacleGrid.size(),n = obstacleGrid[0].size();
int num[m+1][n+1];
for(int i=0;i<m+1;i++){
for(int j = 0;j<n+1;j++){
num[i][j] = 0;
}
}
num[1][0] = 1;
for(int i=1;i<m+1;i++){
for(int j=1;j<n+1;j++){
if(!obstacleGrid[i-1][j-1]){
num[i][j] = num[i][j-1]+num[i-1][j];
}
}
}
return num[m][n];
}
};