[leetcode]45. Jump Game II(Java)
来源:互联网 发布:hadoop能用python吗 编辑:程序博客网 时间:2024/06/06 10:43
https://leetcode.com/problems/jump-game-ii/#/description
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 1
step from index 0 to 1, then 3
steps to the last index.)
Note:
You can assume that you can always reach the last index.
Java Code:
package go.jacob.day625;public class Demo1 {/* * Runtime: 9 ms. Your runtime beats 93.99 % of java submissions. * 参考自leetcode网友:@adam20 * * The main idea is based on greedy. Let's say the range of the current jump * is [curBegin, curEnd], curFarthest is the farthest point that all points * in [curBegin, curEnd] can reach. Once the current point reaches curEnd, * then trigger another jump, and set the new curEnd with curFarthest, then * keep the above steps, as the following */public int jump(int[] A) {int jumps = 0, curEnd = 0, curFarthest = 0;for (int i = 0; i < A.length - 1; i++) {curFarthest = Math.max(curFarthest, i + A[i]);if (i == curEnd) {jumps++;curEnd = curFarthest;}}return jumps;}}
阅读全文
0 1
- (Java)LeetCode-45. Jump Game II
- [leetcode]45. Jump Game II(Java)
- [Leetcode] Jump Game II (Java)
- [LeetCode][Java] Jump Game II
- leetcode:Jump Game II 【Java】
- Jump Game II leetcode java
- LeetCode --- 45. Jump Game II
- LeetCode 45.Jump Game II
- [Leetcode] 45. Jump Game II
- [leetcode] 45.Jump Game II
- [leetcode] 45.Jump Game II
- leetcode 45. Jump Game II
- LeetCode 45. Jump Game II
- LeetCode 45. Jump Game II
- leetcode.45. Jump Game II
- leetcode 45. Jump Game II
- leetcode 45. Jump Game II
- [LeetCode] 45. Jump Game II
- 算法作业HW17:LeetCode101 Symmetric Tree
- 【PB】配置外源数据库(以SQL Server为例)
- 配置CORS解决跨域调用—反思思考问题的方式
- 谈谈对OS中的中间虚拟层的看法
- Struts网站基于Filter的XSS漏洞修复
- [leetcode]45. Jump Game II(Java)
- P1066 2^k进制数 NOIP 2006 提高组 第四题
- android桌面小部件appwidget使用ListView或者StackView如何刷新
- 响应式设计(responsive web design)的视图显示法
- TCP 握手与挥手
- color报错
- EJB学习笔记_10_依赖注入(beanname注入)
- BZOJ 1925: [Sdoi2010]地精部落 dp
- python的pygame涉猎