LeetCode: Jump Game II
2012-10-07 15:56
369 查看
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 =
The minimum number of jumps to reach the last index is
(Jump
from index 0 to 1, then
to the last index.)
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
1step
from index 0 to 1, then
3steps
to the last index.)
class Solution { public: int jump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n <= 1) return 0; int minStep = 0; int maxLen = 0; int i = 0; while (i < n) { if (A[i] > 0) ++minStep; else return 0; // 当前所能达到的最远距离 maxLen = A[i] + i; if (maxLen >= n-1) return minStep; int tmp = 0; // 下一步所能达到最远距离的起始坐标 for (int j = i + 1; j <= maxLen; ++j) { if (tmp <= A[j] + j) { tmp = A[j] + j; i = j; } } } return minStep; } };
相关文章推荐
- Jump Game II -- LeetCode
- 【Leetcode】【python】Jump Game/Jump Game II
- leetcode[45]Jump Game II
- [leetcode]Jump Game II
- [LeetCode]Jump Game II、Jump Game
- leetcode Jump Game II
- leetcode - 45.Jump Game II
- [LeetCode] Jump Game II
- [Leetcode] Jump Game II (Java)
- [LeetCode]Jump Game II
- leetcode — jump-game-ii
- [LeetCode] Jump Game II
- [leetcode 45] Jump Game II
- LeetCode-Jump Game II
- Leetcode 贪心 Jump Game II
- LeetCode力扣之Jump Game II
- leetcode45 Jump Game II
- Leetcode -- Jump Game II
- [leetcode-45]Jump Game II(c)
- [LeetCode] Jump Game II