63. Unique Paths II
来源:互联网 发布:natapp内网穿透域名 编辑:程序博客网 时间:2024/04/29 21:37
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.
int uniquePathsWithObstacles(vector<vector<int>>& o) { int m = o.size(); int n = o[0].size(); vector<vector<int>> res(m, vector<int>(n, 1)); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (o[i][j]) res[i][j] = 0; else if (i == 0 && j == 0) res[i][j] = 1; else { int up = i == 0 ? 0 : res[i - 1][j]; int left = j == 0 ? 0 : res[i][j - 1]; res[i][j] = up + left; } } } return res[m - 1][n - 1];}
0 0
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- TimesTen 中文白皮书和数据表
- java中的数据类型转换
- 笔记:MD5
- 系统自带定位
- 遗传算法B
- 63. Unique Paths II
- CFile 与 CStdioFile的区别
- Android 5.0 CardView+ListView 卡片布局应用
- VC++开发个人事务管理信息系统
- Java虚拟机相关知识(1)—Java内存区域
- 设计模式——代理模式
- javascript中使用MSXML调用我自己电脑上的WEBservice
- node.js Stream
- Apache Shiro去掉URL中的JSESSIONID