leetcode
来源:互联网 发布:java 写入excel模板 编辑:程序博客网 时间:2024/06/07 01:54
Jump Game II
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.
Solution:
public int jump(int[] nums) { int min = 0; int max = 0; int index = 0; for (int i = 0; i < nums.length - 1; i++) { max = Math.max(max, i + nums[i]); if (index == i) { min++; index = max; } } return min; }
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- Gson使用详情
- 基于Jetson TX1的caffe环境搭建
- 二叉树的顺序存储和链式存储结构(java实现)
- 七个习惯
- 深入分析java web技术内幕----读书笔记(二)
- leetcode
- 机器人操作系统ROS Indigo 入门学习(3)——文件系统导航
- leetcode
- 微信批量拉取用户信息
- Java API操作hbase数据案例
- Python xlwd 读取excel xlwt 写入excel xlutils 修改excel
- Eclipse neon2 在多版本JDK环境下运行方法
- leetcode
- 重做日志与归档日志