Jump Game II
来源:互联网 发布:js 改变display 编辑:程序博客网 时间:2024/05/16 02:16
Q:
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.)
Solution:
public class Solution { public int jump(int[] A) { int index = 0; int jump = 0; while (index < A.length - 1) { if (index + A[index] >= A.length - 1) return jump + 1; int max = 0; int maxi = 0; for (int i = 1; index + i < A.length && i <= A[index]; i++) { if (index + i + A[index+i] > max) { max = index + i + A[index+i]; maxi = index + i; } } index = maxi; jump++; } return jump; }}
0 0
- Jump Game &Jump Game II
- Jump Game/Jump Game II
- LeetCode: Jump Game II
- LeetCode Jump Game II
- LeetCode: Jump Game II
- [Leetcode] Jump Game II
- [LeetCode] Jump Game II
- [Leetcode] Jump Game ii
- leetcode Jump Game II
- Jump Game II
- Jump Game II
- Jump Game II
- leetcode Jump Game II
- [LeetCode]Jump Game II
- Jump Game II
- Jump Game II
- Jump Game II
- Jump Game II
- SpringMVC使用FileUpload进行文件上传
- 工作笔记4.struts2上传文件到服务器
- LeetCode Maximum Subarray
- OpenWRT的源码下载及目录结构
- LeetCode Pow(x, n)
- Jump Game II
- Google-APAC2015-"super 2048"
- Club1003:A+B 输入输出练习IV
- 价格规范化方法根据规划及规范化
- Club1004:A+B 输入输出练习V
- Club1005:A+B 输入输出练习VI
- Club1006:A+B 输入输出练习VII
- Club1007:A+B 输入输出练习VIII
- scanf(),printf()和gets(),puts()在输入输出字符串时的区别