[LeetCode]Jump Game II
来源:互联网 发布:阿里云数据中心 编辑:程序博客网 时间:2024/05/17 22:00
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.)
public class Solution {public int jump(int[] A) {int index = 0;int step = 0;while(true){if(index+A[index]>=A.length-1){if(index!=A.length-1) step++;break;}int step2 = 1;int k = index;for (int i = k; i <= k+A[k]; i++) {if (i - k + A[i] >= step2) {step2 = i - k + A[i];index = i;}}step++;}return step;}}
0 0
- 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
- 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
- LeetCode | Jump Game II
- 【Leetcode】Jump Game II
- LeetCode Jump Game II
- [LeetCode] Jump Game II
- 用exp无法导出空表解决方法
- source命令用法:
- 多种jQuery插件
- Ubuntu 新手常见问题与解答
- IMSI
- [LeetCode]Jump Game II
- 中科昆锐浅谈加速度传感器输出接头形式
- 常见Visual Studio项目类型的GUID
- 再识今目标
- Android开发20——单个监听器监听多个按钮点击事件
- JSP空间租用
- HDU5023 - A Corrupt Mayor's Performance Art(线段树)
- C++ list 成员函数
- webpy服务端口no socket could be created