LeetCode--Unique Paths II
来源:互联网 发布:php编辑器代码 编辑:程序博客网 时间:2024/06/14 08:45
题目:
接着上一道题目Unique Paths,考虑到障碍问题。在matrix(m*n)矩阵中有障碍的地方设为1,否则为0。计算到达右下角的不同路径有多少种。
解题思路:
考虑使用动态规划的方式解题,同上个题目一样,要到达(i,j),则要先到达(i-1,j)或者(i,j-1)。另外若(i,j)位置为障碍物的话,到达(i,j)的路径个数为0.
代码(python):
class Solution(object): def uniquePathsWithObstacles(self, obstacleGrid): """ :type obstacleGrid: List[List[int]] :rtype: int """ for i in range(len(obstacleGrid)): for j in range(len(obstacleGrid[0])): if obstacleGrid[i][j]==1: obstacleGrid[i][j]=0 continue elif i==0 and j==0: obstacleGrid[i][j]=1 continue elif i==0 and j!=0: obstacleGrid[i][j]=obstacleGrid[i][j-1] continue elif i!=0 and j==0: obstacleGrid[i][j]=obstacleGrid[i-1][j] continue else: obstacleGrid[i][j]=obstacleGrid[i-1][j]+obstacleGrid[i][j-1] return obstacleGrid[len(obstacleGrid)-1][len(obstacleGrid[0])-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
- 课堂笔记
- 《MYSQL性能调优与框架设计》-总结
- POI导出Excel--合并单元格
- Spring AOP系列之AOP原理介绍
- Yocto: Building Yocto with meta-altera
- LeetCode--Unique Paths II
- 编写切面日志
- graphviz 路径问题
- redis3.0配置文件详解
- INIT_WORK和INIT_DELAYED_WORK
- Android-9种通话状态(精确)
- 如何生成关键词云图
- android中build.gradle详细说明
- Design Pattern 0: Intro