链接:http://leetcode.com/onlinejudge#question_63
原题:
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.
思路:
简单的DP,方格中的每一个格子,都有两种途径:1.从上方下来;2.从左边过来。
state[i][j] = state[i-1][j] + state[i][j-1] if obstacleGrid[i][j] == 0
0 if obstacleGrid[i][j] == 1
P.S. 这题目不用考虑溢出
代码:
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (obstacleGrid.size() == 0)
return 0;
int row = obstacleGrid.size();
int col = obstacleGrid[0].size();
vector<vector<int> > state;
vector<int> temp(col);
for (int i=0; i<row; i++)
state.push_back(temp);
for (int j=0; j<col; j++)
if (obstacleGrid[0][j] == 0) {
state[0][j] = 1;
} else {
break;
}
for (int i=1; i<row; i++) {
if (obstacleGrid[i][0] == 0)
state[i][0] = state[i-1][0];
for (int j=1; j<col; j++) {
if (obstacleGrid[i][j] == 0)
state[i][j] = state[i-1][j] + state[i][j-1];
}
}
return state[row-1][col-1];
}
};