Frog Jump
来源:互联网 发布:三星手机手电筒软件 编辑:程序博客网 时间:2024/06/02 12:23
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.Return true. 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.
class Solution {
public:
/**
* @param stones a list of stones' positions in sorted ascending order
* @return true if the frog is able to cross the river or false
*/
bool canCross(vector<int>& stones) {
unordered_map<int, unordered_set<int> > dp;
for (auto i : stones) {
dp[i] = unordered_set<int>();
}
dp[0].insert(0);
for (auto i : stones) {
for (auto k : dp[i]) {
if ( k - 1 > 0 && dp.find(i + k - 1) != dp.end()) {
dp[i + k - 1].insert(k - 1);
}
if ( dp.find(i + k) != dp.end()) {
dp[i + k].insert(k);
}
if ( dp.find(i + k + 1) != dp.end()) {
dp[i + k + 1].insert(k + 1);
}
}
}
return !(dp[stones.back()].empty());
}
};
- Frog Jump
- Frog Jump
- frog jump
- Frog Jump
- Frog Jump
- Frog Jump
- Frog Jump
- Frog Jump
- LeetCode #403: Frog Jump
- [leetcode]403. Frog Jump
- [Leetcode] Frog Jump
- leetcode 403.Frog Jump
- 403. Frog Jump
- 【LeetCode】403. Frog Jump
- Leetcode (403) Frog Jump
- LeetCode403. Frog Jump
- 403. Frog Jump
- [leetcode] 403. Frog Jump
- Spring bean 生命周期
- FFmpeg提取第一个视频合并第二个视频的音频同时加2个水印
- ASP.NET中Request.ApplicationPath、Request.FilePath、Request.Path、.Request.MapPath、
- Formatter(格式化)
- 黑盒测试面试
- Frog Jump
- 背景建模与前景检测(一)——混合高斯GMM
- 作为一个Java面试官,你最起码要问下面的问题。
- 历届试题 兰顿蚂蚁
- 基于数组的词典
- Hibernate Search 和 Lucene 的快速介绍 转载自linux公社
- VBScript MsgBox 函数
- Android5.0以上获取正在运行的应用
- android Service 篇