Leetcode题集——jump-game
来源:互联网 发布:折半查找算法过程 编辑:程序博客网 时间:2024/06/06 05:56
jump-game:
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.
Determine if you are able to reach the last index.
For example:
A =[2,3,1,1,4], return true.
A =[3,2,1,0,4], return false.
解析:设置变量maxi,表示最远能跳多远。将数组从头开始遍历,当i+A[i]大于maxi时,更新maxi。
直到遍历结束,如maxi>=n-1,则返回为真。用到了贪心算法。
bool canJump(int A[], int n) { int maxi=A[0]; for(int i=1;i<n-1;i++) {//最后一个位置n-1不在循环内 //第i个位置不可到达,返回错误. if(i>maxi) return false; if(i+A[i]>maxi) maxi=i+A[i]; } if(maxi>=n-1) return true; else return false; }
jump-gameII:
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. (Jump1step from index 0 to 1, then 3steps to the last index.)
解析:先找到一个能一口气跳到数组末尾的点i,然后查找能一口气跳到点i的点,一直递归,直到返回到原点。int jump(int A[], int n) { if(n<=1) return 0; int end=n-1; int count=0; while(end) { for(int i=0;i<end;i++) { if(i+A[i]>=end) { count++; end=i; } } } return count; }
- Leetcode题集——jump-game
- LeetCode——Jump Game
- leetcode——Jump Game
- LeetCode——Jump Game
- leetcode 045 —— Jump Game II
- leetcode 055 —— Jump Game
- leetcode——Jump Game II
- LeetCode Jump Game && Jump GameII
- leetcode——55——Jump Game
- 数据结构与算法[LeetCode]——Jump Game I II
- 【leetcode】Array——Jump Game(55)
- leetcode刷题之旅——55. Jump Game
- LeetCode算法题——Jump Game II
- [LeetCode]Jump Game II、Jump Game
- 【LeetCode】Jump Game & Jump Game II
- leetcode Jump Game & Jump Game II
- leetcode之Jump Game && Jump Game II
- [leetcode]Jump Game &&Jump Game II
- minerd木马处理流程
- 强转 static_cast dynamic_cast reinterpret_cast 疑难杂症
- 大数据安全分析漫谈
- 情感分析
- 【iOS开发】iOS移动端架构
- Leetcode题集——jump-game
- R 绘图系统
- 学习资源
- web前台后台实现下载功能
- hrbust 2163 棋盘取数【最大权独立集合-------最大流Dinic】
- Android 通过UsageStatsManager获取App使用情况
- 如何用WORD制作三线表
- 2016.07.16【初中部 NOIP提高组 】模拟赛C
- MATLAB内部函数