LeetCode:Jump Game
2015-03-25 20:34
169 查看
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) { int reach=0; int i=0; for(;i<n&&i<=reach;i++) { reach=max(i+A[i],reach); } return i==n; } };
或者从后往前推:
class Solution { public: bool canJump(int A[], int n) { int last=n-1,i,j; for(i=n-2;i>=0;i--) { if(A[i]+i>=last) last=i; } return last<=0; } };
相关文章推荐
- [LeetCode] Jump Game
- Leetcode 之 Jump Game
- leetcode-jump Game2
- 【LeetCode】Jump Game
- leetcode -- Jump Game-- 重点--Greedy
- [LeetCode] Jump Game 数组控制
- LeetCode55——Jump Game
- [LeetCode] Jump Game
- [Leetcode]Jump Game
- leetcode 55 Jump Game C++
- leetcode55 Jump Game
- [LeetCode] Jump Game 跳跃游戏
- [Leetcode] 55. Jump Game 解题报告
- leetcode55 Jump Game
- [LeetCode] Jump Game
- LeetCode之Jump Game
- 【leetcode】Jump Game
- LeetCode:Jump Game
- [leetcode解题记录]Jump Game和Jump Game II
- [leetcode]Jump Game