LeetCode 403. Frog Jump 题解
来源:互联网 发布:网络考试平台 编辑:程序博客网 时间:2024/06/05 05:49
LeetCode 403. Frog Jump 题解
题目描述
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
Given a list of stones’ positions (in units) in sorted ascending order, determine if the frog is able to cross the river by landing on the last stone. Initially, the frog is on the first stone and assume the first jump must be 1 unit.
If the frog’s last jump was k units, then its next jump must be either k - 1, k, or k + 1 units. Note that the frog can only jump in the forward direction.
Note:
The number of stones is ≥ 2 and is < 1,100.
Each stone’s position will be a non-negative integer < 231.
The first stone’s position is always 0.
Example 1:
[0,1,3,5,6,8,12,17] There are a total of 8 stones.
The first stone at the 0th unit, second stone at the 1st unit,
third stone at the 3rd unit, and so on…
The last stone at the 17th unit.
Returntrue
. The frog can jump to the last stone by jumping
1 unit to the 2nd stone, then 2 units to the 3rd stone, then
2 units to the 4th stone, then 3 units to the 6th stone,
4 units to the 7th stone, and 5 units to the 8th stone.
Example 2:
[0,1,2,3,4,8,9,11] Return
false
. There is no way to jump to the last stone as
the gap between the 5th and 6th stone is too large.
题目分析
这道题大意就是一个过河问题。 从
没有多想, 直接用的DP做的。 发现效果还不错。
具体就是用一个canReach
数组, 记录是否能够到达某个stones[i]
.仅仅这样还不够, 要记录完整状态, 还得再加一个维度, 用于描述 是否能跳 stones[i]
。
这就是整个动规了。完全没有其他东西。只是因为是道 Hard,所以写写。 感觉像是Medium。
状态转移方程就是下面代码中两层循环里面那句话, 相信是很好懂的吧。无非就是把题目约束用代码翻译了一遍~。~
代码如下:
class Solution {public: bool canCross(vector<int>& stones) { vector< vector<bool> > canReach(stones.size()); for (int i = 0; i < canReach.size(); ++i) { canReach[i].resize(stones.size() + 1); } canReach[0][0] = true; for (int i = 1; i < stones.size(); ++i) { for (int j = i - 1; j >= 0; --j) { if (stones[i] - stones[j] >= stones.size()) break; if(canReach[j][stones[i] - stones[j] - 1] || canReach[j][stones[i] - stones[j] + 1] || canReach[j][stones[i] - stones[j]]) { canReach[i][stones[i] - stones[j]] = true; } } } for (int i = 0; i < stones.size(); ++i) { if (canReach[stones.size() - 1][i]) return true; } return false; }};
其他细节
既然这篇在前面基本没写什么内容, 就在这里多写一点吧。感觉还是挺重要的。
1. 这并不是唯一做法。 甚至运行时比DFS还要高, 但是DFS肯定有其局限性的。 看到discuss里面有人说用JAVA+DFS跑出很好的情况, 大致看了一下其做法。首先要肯定的是, DFS的做法耗时肯定要更少是真的。 原因在于, DFS优先往大了跳, 指不定就还真跳到了就赚到了。 即使不济总搜索次数还是和DP相同。 而DP是稳定每次都会把状态全部计算了一遍。 虽然避免了重复计算, 但是可能产生无用计算。
- 最原先我AC的DP代码其实和上面那个不太一样, 贴出来对比:
for (int i = 1; i < stones.size(); ++i) { for (int j = 0; j < i; ++j) { if (stones[i] - stones[j] >= stones.size()) continue; if(canReach[j][stones[i] - stones[j] - 1] || canReach[j][stones[i] - stones[j] + 1] || canReach[j][stones[i] - stones[j]]) { canReach[i][stones[i] - stones[j]] = true; } } }
之后我做了两次修改, 有促进的那次在上面代码中已经体现了: 换了一下搜索顺序, 可以及时避免无用计算。 还有一次, 我把状态转移的那行代码写成了这样:
canReach[i][stones[i] - stones[j]] = (canReach[j][stones[i] - stones[j] - 1] || canReach[j][stones[i] - stones[j] + 1] || canReach[j][stones[i] - stones[j]]);
结果耗时反而比使用if
多了不少, 以后注意避免这种写法。 (看来果然访问内存在执行速度上是最慢的啊。。。)
The End.
- LeetCode 403. Frog Jump 题解
- LeetCode题解(Week 8):403. Frog Jump
- [leetcode]403. Frog Jump
- leetcode 403.Frog Jump
- 【LeetCode】403. Frog Jump
- [leetcode] 403. Frog Jump
- Leetcode 403. Frog Jump
- [LeetCode]403. Frog Jump
- Leetcode 403. Frog Jump
- [Leetcode] 403. Frog Jump
- leetcoder 403. Frog Jump 题解
- LeetCode—403. Frog Jump
- Frog Jump - leetcode 403号题目个人题解
- LeetCode 403. Frog Jump|动态规划
- Leetcode-403.Frog Jump(青蛙跳石头)
- 动态规划 hard LeetCode 403. Frog Jump
- [leetcode] Add to List 403. Frog Jump
- [Leetcode] 403. Frog Jump 解题报告
- 盖伦蹲草丛
- LeetCode Weekly Contest 56 解题报告
- 2017118每日练习
- Code forces 887A Div.64解题报告
- #javaGUI#基于swing包的java用户界面设置入门,布局篇
- LeetCode 403. Frog Jump 题解
- C语言学习笔记(九)——IDE
- Vim 使用特殊符号快速删除指定字符,文件加密,粘贴代码缩进解决
- 自己写了一个flume小文件合并脚本,解决hdfs小文件过多问题
- win10下配置Tensorflow1.4
- 编程思想(一):面向对象思想及衍生特性
- 蓝桥杯 历届试题 分糖果
- STL自定义比较器
- Mac下安装Elasticsearch极简指南