leetcode - Unique Paths II
2015-08-08 21:20
477 查看
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(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]; } };
相关文章推荐
- UIStepper
- UIScrollView 按页面滚动视图 UIPageControl
- POJ2478 Farey Sequence(欧拉函数,打表)
- Pixel Width of the text in a UILabel
- UITableView省市区字典
- UI05_Control(UIStepper加减音量/UIBlurEffect毛玻璃/UISlider滑动/UISegmentedControl小模块)
- [leetcode] Implement Queue using Stacks
- UIButton的一些常用知识点
- [leetcode 234]Implement Queue using Stacks
- UVA 10420 List of Conquests
- UIViewController的生命周期
- UIViewController
- opencv开发之MFC的.SetWindowTextA() + OnTimer(UINT_PTR nIDEvent) +cvNamedWindow 在MFC上显示
- UI中简单的猜数字游戏
- UI, 关灯游戏的实现
- Longest Consecutive Sequence
- android自定义UI模板图文详解
- UIScrollView无法滚动的解决办法
- UITextField
- android中键盘不遮挡ui界面的方法