[leetcode] Add to List 403. Frog Jump
2017-08-14 16:07
387 查看
题目链接:https://leetcode.com/problems/frog-jump/description/
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:
Example 2:
方法一:(dfs)
class Solution {
public:
bool canCross(vector<int>& stones) {
if(stones.empty()) return false;
int n=stones.size();
if(n==1 && stones[0]==0) return true;
if(n==1 && stones[0]!=0) return false;
if(n==2 && stones[1]==1) return true;
if(n==2 && stones[1]!=1) return false;
s.insert(0);
for(int i=1;i<n;i++)
{
s.insert(stones[i]);
// suppose every step jump at max units,
// that is If the frog's last jump was k units, then its next jump must be k + 1 units.
//so the sequence is 0 1 3 6 10 15..... stones[i]-stones[i-1]==i
if(stones[i]-stones[i-1]>i)
return false;
}
return dfs(1,1,stones[n-1]);
}
bool dfs(int k,int pos,int destination)
{
if(pos>destination || s.find(pos)==s.end()) return false;
if(pos==destination) return true;
for(int i=1;i>=-1;i--)
if(k+i>0 && dfs(k+i,pos+k+i,destination)) return true;
return false;
}
private:
unordered_set<int> s;
};
方法二:(dp)
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.
方法一:(dfs)
class Solution {
public:
bool canCross(vector<int>& stones) {
if(stones.empty()) return false;
int n=stones.size();
if(n==1 && stones[0]==0) return true;
if(n==1 && stones[0]!=0) return false;
if(n==2 && stones[1]==1) return true;
if(n==2 && stones[1]!=1) return false;
s.insert(0);
for(int i=1;i<n;i++)
{
s.insert(stones[i]);
// suppose every step jump at max units,
// that is If the frog's last jump was k units, then its next jump must be k + 1 units.
//so the sequence is 0 1 3 6 10 15..... stones[i]-stones[i-1]==i
if(stones[i]-stones[i-1]>i)
return false;
}
return dfs(1,1,stones[n-1]);
}
bool dfs(int k,int pos,int destination)
{
if(pos>destination || s.find(pos)==s.end()) return false;
if(pos==destination) return true;
for(int i=1;i>=-1;i--)
if(k+i>0 && dfs(k+i,pos+k+i,destination)) return true;
return false;
}
private:
unordered_set<int> s;
};
方法二:(dp)
相关文章推荐
- [leetcode] 64. Minimum Path Sum Add to List
- LeetCode 25 Reverse Nodes in k-Group Add to List (划分list为k组)
- [leetcode] Add to List 169. Majority Element
- LeetCode 143 Reorder List Add to List
- Leetcode--Add to List 371. Sum of Two Integers
- 【LeetCode】417. Pacific Atlantic Water Flow Add to List
- Leetcode--Add to List 201. Bitwise AND of Numbers Range
- 【LeetCode】Add to List 606. Construct String from Binary Tree
- LeetCode406. Queue Reconstruction by Height Add to List
- [leetcode]500.Keyboard Row Add to List
- LeetCode-Add to List 494. Target Sum
- leetcode 500 Keyboard Row Add to List
- LeetCode- Add to List 88. Merge Sorted Array
- 【LeetCode24】. Swap Nodes in Pairs Add to List
- leetcode_ Add to List 121. Best Time to Buy and Sell Stock
- Leetcode--Add to List 374. Guess Number Higher or Lower
- LeetCode - Add to List 557. Reverse Words in a String III
- leetcode- Add to List 458. Poor Pigs
- leetcode_ Add to List 108. Convert Sorted Array to Binary Search Tree
- [Leetcode] 2.Add Two Numbers(List To Long,模拟)