LeetCode Unique Paths II
2014-08-27 23:36
411 查看
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
in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
The total number of unique paths is
Note: m and n will be at most 100.
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
unsigned m = obstacleGrid.size();
unsigned n = obstacleGrid[0].size();
if (m == 0 || n == 0)
return 0;
vector<vector<int> > array(m, vector<int>(n, 1));
for (int i = 0; i < m; ++i) {
if (obstacleGrid[i][0] == 1) {
for (int j = i; j < m; ++j)
array[j][0] = 0;
break;
}
}
for (int i = 0; i < n; ++i) {
if (obstacleGrid[0][i] == 1) {
for (int j = i; j < n; ++j)
array[0][j] = 0;
break;
}
}
for (int i = 1; i < m; ++i) {
for (int j = 1; j < n; ++j) {
if (obstacleGrid[i][j] == 1)
array[i][j] = 0;
else
array[i][j] = array[i][j - 1] + array[i - 1][j];
}
}
return array[m - 1][n - 1];
}
};
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
1and
0respectively
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) {
unsigned m = obstacleGrid.size();
unsigned n = obstacleGrid[0].size();
if (m == 0 || n == 0)
return 0;
vector<vector<int> > array(m, vector<int>(n, 1));
for (int i = 0; i < m; ++i) {
if (obstacleGrid[i][0] == 1) {
for (int j = i; j < m; ++j)
array[j][0] = 0;
break;
}
}
for (int i = 0; i < n; ++i) {
if (obstacleGrid[0][i] == 1) {
for (int j = i; j < n; ++j)
array[0][j] = 0;
break;
}
}
for (int i = 1; i < m; ++i) {
for (int j = 1; j < n; ++j) {
if (obstacleGrid[i][j] == 1)
array[i][j] = 0;
else
array[i][j] = array[i][j - 1] + array[i - 1][j];
}
}
return array[m - 1][n - 1];
}
};
相关文章推荐
- leetcode Unique Paths II
- [Leetcode]Unique Paths II
- LeetCode题解:Unique Paths II
- [Leetcode]Unique Paths II
- Unique Paths II - LeetCode 63
- 28_leetcode_Unique Paths II
- [LeetCode]Unique Paths II
- [Leetcode] Unique Paths II
- [LeetCode] Unique Paths II
- LeetCode Unique Paths II
- LeetCode:Unique Paths II
- leetcode ---Unique Paths II
- leetcode || 63、Unique Paths II
- [leetcode刷题系列]Unique Paths II
- [leetcode]Unique Paths II
- leetcode: Unique Paths II
- 开始刷leetcode day60: Unique Paths II
- leetcode unique paths ii
- [LeetCode] Unique Paths II
- Leetcode Unique Paths II