leetcode[55]Jump Game
2015-02-09 14:40
417 查看
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.
Determine if you are able to reach the last index.
For example:
A =
A =
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example:
A =
[2,3,1,1,4], return
true.
A =
[3,2,1,0,4], return
false.
class Solution { public: bool canJump(int A[], int n) { if(n<=1)return true; int right=n-1; int cur=n-1; while(cur>0) { for (int i=cur-1; i>=0; i--) { if (i+A[i]>=right) { if (i<cur)cur=i; } } if(cur==right)return false; right=cur; } return true; } };
相关文章推荐
- [LeetCode] 55. Jump Game
- LeetCode 55 Jump Game
- 【LeetCode】C# 55、Jump Game
- 第六周:(LeetCode 45 55) Jump Game I II(c++)
- leetcode——55——Jump Game
- Leetcode 55 Jump Game(第七周作业)
- leetcode-55 Jump Game 最远距离问题
- Leetcode 55 - Jump Game
- LeetCode 55 Jump Game
- LeetCode(55)Jump Game
- LeetCode(55) Jump Game
- LeetCode55 Jump Game
- LeetCode(55) Jump Game
- LeetCode 55: Jump Game
- LeetCode-55-Jump Game
- LeetCode 55 - Jump Game
- [LeetCode 55] Jump Game
- [leetcode 55] Jump Game
- leetcode-55 Jump Game
- LeetCode55——Jump Game