Jump Game II (最小步数到达终点,贪心) 【leetcode】
2013-09-20 19:33
393 查看
题目:
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A =
The minimum number of jumps to reach the last index is
(Jump
from index 0 to 1, then
to the last index.)
这题就是已知能到达终点,问最小的步数。
依旧贪心去推,贪心的规则就是在能够到达的范围之内,选择一个能够到达最远距离的点,更新步数,和更新最远到达的范围。
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A =
[2,3,1,1,4]
The minimum number of jumps to reach the last index is
2.
(Jump
1step
from index 0 to 1, then
3steps
to the last index.)
这题就是已知能到达终点,问最小的步数。
依旧贪心去推,贪心的规则就是在能够到达的范围之内,选择一个能够到达最远距离的点,更新步数,和更新最远到达的范围。
class Solution { public: int jump(int A[], int n) { int maxx=0,temp=0,num=0; for(int i=0;i<n;) { if(temp>=n-1)break; while(i<=temp) { maxx=max(maxx,i+A[i]); ++i; } num++; temp=maxx; } return num; } };
相关文章推荐
- leetcode -- Jump Game II -- 贪心,要看
- leetcode---jump-game-ii---贪心
- [LeetCode]Jump Game II(贪心&&DP!!!!!)
- LeetCode刷题笔记(贪心):jump-game-ii
- 【LeetCode】Jump Game II 跳跃游戏II - 贪心 Medium
- [leetcode][贪心] Jump Game II
- LeetCode Jump Game II(贪心)
- [LeetCode] Jump Game II 贪心
- Jump Game II 跳跃游戏(求跳到最后一个的最小步数) @LeetCode
- Leetcode 贪心 Jump Game II
- LeetCode:Jump Game II
- [LeetCode]Jump Game II
- LeetCode(045) Jump Game II (Java)
- 【LeetCode】Jump Game II
- leetcode-Jump game II
- Jump Game II - LeetCode
- [LeetCode] Jump Game II
- Leetcode45 Jump Game II
- Leetcode之Jump Game & Jump Game II
- LeetCode——Jump Game II