LeetCode Unique Paths II
2015-03-28 00:07
183 查看
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.
题意:就有有障碍的机器人路径个数。
思路:多了一个判断障碍的情况,其他的不变。
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) { vector<vector<int> > f(obstacleGrid.size(), vector<int>(obstacleGrid[0].size())); f[0][0] = obstacleGrid[0][0] == 1 ? 0 : 1; for (int i = 1; i < f.size(); i++) f[i][0] = obstacleGrid[i][0] == 1 ? 0 : f[i-1][0]; for (int i = 1; i < f[0].size(); i++) f[0][i] = obstacleGrid[0][i] == 1 ? 0 : f[0][i-1]; for (int i = 1; i < f.size(); i++) for (int j = 1; j < f[i].size(); j++) f[i][j] = obstacleGrid[i][j] == 1 ? 0 : (f[i-1][j] + f[i][j-1]); return f[f.size()-1][f[0].size()-1]; } };
相关文章推荐
- LeetCode 063 Unique Paths II
- [LeetCode] Unique Paths II
- 【LeetCode】Unique Paths I && II && Minimum Path Sum
- [LeetCode] Unique Paths II
- LeetCode Unique Paths II
- LeetCode - Unique Paths II
- leetcode做题总结,动态规划I(Triangle,Unique PathsI/II,Minimum Path Sum,Climbing Stairs,Jump Game,Word Break)
- leetcode--Unique Paths II
- Leetcode: Unique Paths II
- LeetCode - Unique Paths II
- LeetCode Unique Paths II
- Leetcode:Unique Paths II
- leetcode 063 —— Unique Paths II
- 【leetcode】Array——Unique Paths II(63)
- [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