leetcode - Unique Paths II
来源:互联网 发布:js format 函数 编辑:程序博客网 时间:2024/06/05 01:05
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(std::vector<std::vector<int> > &obstacleGrid) { std::vector<std::vector<int>> dp(obstacleGrid.size(),std::vector<int>(obstacleGrid[0].size(),0));dp[0][0] = obstacleGrid[0][0] ? 0 : 1;for (int i = 1; i < obstacleGrid.size(); i++){dp[i][0] = obstacleGrid[i][0] ? 0 : dp[i-1][0];}for (int i = 1; i < obstacleGrid[0].size(); i++){dp[0][i] = obstacleGrid[0][i] ? 0 : dp[0][i-1];}for (int i = 1; i < obstacleGrid.size(); i++){for (int j = 1; j < obstacleGrid[0].size(); j++){dp[i][j] = obstacleGrid[i][j] ? 0 : dp[i-1][j] + dp[i][j-1];}}return dp[obstacleGrid.size()-1][obstacleGrid[0].size()-1]; }};
0 0
- 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] 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: Unique Paths II
- LeetCode Unique Paths II
- Unique Paths II -- LeetCode
- [LeetCode] Unique Paths II
- 抓取dump的头文件
- jQuery EasyUI 为Combo,Combobox添加清除值功能
- AWR
- exp指数实现
- 框架学习七-1:ViewPager+Fragment之Fragment介绍
- leetcode - Unique Paths II
- eclipse开两个控制台分别打印两个进程的输出
- Search Insert Position
- 总弹出Visual Studio实时调试器的问题
- 关于Java两种同步方法的理解(代码块级同步对象设置)
- 关于 gpio port
- GPRS模块和GSM模块的差别
- 苹果IOS开发者账号总结
- 【spring MVC学习二】springMVC简单使用