LeetCode Unique Paths II
来源:互联网 发布:淘宝游戏专营还会开吗 编辑:程序博客网 时间:2024/06/12 00:14
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(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];}};
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
- 內置框架也能使用Lightbox
- Linux启动过程
- Ubantu 12.04 安装theano + pylean2
- php 对象和设计
- 图像的监听 , 和图片选择器的的使用
- LeetCode Unique Paths II
- 学java教程之构造方法重载
- openwrt新手编译注意部分
- 用init创建的的控制器的视图会从下加载
- hdu 2066 一个人的旅行(Dijkstra求最短路)
- android Rect的使用
- 听书简单应用
- 自定义PopupWindow
- QT5.3.1和VS2013链接出错