LeetCode 45 Jump Game II
来源:互联网 发布:windows 7 共享 选项卡 编辑:程序博客网 时间:2024/05/17 04:08
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.
贪心法:
public int jump(int[] nums) {int reach = 0;//最右能跳到哪里int last = 0;//上次落的的最大号阶梯,如果当前超过了,那必然是step了一下int step = 0;//步数for (int i = 0; i < nums.length; i++) {if (i > last) {step++;last = reach;}reach = Math.max(reach, i + nums[i]);}return step;}
1 0
- [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
- 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
- 各种开发API文档+开发工具
- HTTP协议知识点总结
- 菜鸟从零开始初始WebSocket -Server篇(二)
- 文件与IO(一)之字节流
- <根据马士兵>动态加载过程
- LeetCode 45 Jump Game II
- hdu4707 Pet
- Android深入浅出自定义控件(一)
- php抓取网页上的指定内容
- modelsim编译vivado ip报错error protect region
- MySQL中多列索引
- VC枚举系统所有字体
- linux搭建svn
- EventBus 3