leetCode 63.Unique Paths II (唯一路径II) 解题思路和方法
来源:互联网 发布:ntp时间服务器端口 编辑:程序博客网 时间:2024/04/29 17:40
Unique Paths II
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.
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.
思路:这题理解题意之后并不比上一题麻烦,只是我在刚开始的时候,没有完全想对思路。
在给第一行和第一列赋值时,如果有障碍了,则后面的则全部赋值为0,表示通不过。
具体代码如下:
public class Solution { public int uniquePathsWithObstacles(int[][] f) { if(f.length == 0 || f[0].length == 0 || f[0][0] > 0) return 0; //其余情况 for(int i = 0; i < f.length; i++){ if(f[i][0] > 0){//如果有障碍,后面全部为0 while(i < f.length){ f[i++][0] = 0; } }else{ f[i][0] = 1;//没有障碍赋值为1 } } for(int i = 1; i < f[0].length; i++){//从i=1开始,因为f[0][0]值已经改变 if(f[0][i] > 0){//如果有障碍,后面全部为0 while(i < f[0].length){ f[0][i++] = 0; } }else{ f[0][i] = 1; } } //循环走到最终点 for(int i = 1; i < f.length; i++) for(int j = 1; j < f[0].length; j++){ if(f[i][j] > 0) f[i][j] = 0;//有障碍,设置0,表示不通 else f[i][j] = f[i-1][j] + f[i][j-1]; } return f[f.length-1][f[0].length-1]; }}
0 0
- leetCode 63.Unique Paths II (唯一路径II) 解题思路和方法
- leetCode 62.Unique Paths (唯一路径) 解题思路和方法
- leetcode 63. Unique Paths II-唯一路径|动态规划
- LeetCode 63. Unique Paths II(唯一路径)
- LeetCode | Unique Paths II(唯一路径II)
- Leetcode 63. Unique Paths II 路径搜寻2 解题报告
- leetCode 95.Unique Binary Search Trees II (唯一二叉搜索树) 解题思路和方法
- [leetcode] 63. Unique Paths II 解题报告
- [Leetcode] 63. Unique Paths II 解题报告
- Unique Paths和Unique Paths II 路径
- Leetcode 62. Unique Paths和63. Unique Paths II
- 【LeetCode-面试算法经典-Java实现】【063-Unique Paths II(唯一路径问题II)】
- [LeetCode]Unique Paths II, 解题报告
- 【LeetCode】Unique Paths II 解题报告
- [LeetCode] Unique Paths II 解题报告
- leetcode解题方案--063--Unique Paths II
- 62. Unique Paths & 63. Unique Paths II(唯一路径1&2)
- LeetCode --- 63. Unique Paths II
- 【斯坦福---机器学习】复习笔记之朴素贝叶斯算法
- 黑马程序员——动态代理
- Java:单例模式的七种写法
- Java中Comparable和Comparator实现对象比较
- SVN数据迁移到Git笔记
- leetCode 63.Unique Paths II (唯一路径II) 解题思路和方法
- JAVA多线程Thread和Runnable的实现
- 正交投影变换与透视投影
- new和malloc的区别
- PostgreSQL 增量备份详解以及相关示例
- 【深度学习】研究FastRcnn代码
- Android开发HTML5应用
- 两台不同网段的PC直连是否可以ping通
- 数据分析