leetcode - 45.Jump Game II
2017-03-13 13:26
344 查看
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; }
相关文章推荐
- Leetcode45 Jump Game II
- LeetCode 45 --- Jump Game II
- Leetcode 55. Jump Game & 45. Jump Game II
- leetcode解题之45. Jump Game II&55. Jump Game java (跳跃游戏)
- LeetCode (45) Jump Game II
- DAY20:leetcode #45 Jump Game II
- leetcode 45. Jump Game II
- leetcode_question_45 Jump Game II
- [LeetCode 45] Jump Game II
- LeetCode (45) Jump Game II
- Leetcode 45 Jump Game II
- LeetCode45 Jump Game II
- LeetCode45——Jump Game II
- leetcode 45: Jump Game II
- 【leetcode】45. Jump Game II
- LeetCode 45 Jump Game II 题解
- [leetcode-45]Jump Game II(java)
- leetcode || 45、 Jump Game II
- leetcode题解-45. Jump Game II
- ★leetcode45_Jump Game II