leetcode-Jump Game
来源:互联网 发布:网络歌手曹菲儿 编辑:程序博客网 时间:2024/06/07 23:39
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 = [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 false; int m = A[0]; for(int i = 0; i < m+1; i++) { int temp = i + A[i]; if(temp >= n-1)return true; if(temp > m)m = temp; } return false; }};
0 0
- LeetCode Jump Game && Jump GameII
- [LeetCode]Jump Game II、Jump Game
- 【LeetCode】Jump Game & Jump Game II
- leetcode Jump Game & Jump Game II
- leetcode之Jump Game && Jump Game II
- [leetcode]Jump Game &&Jump Game II
- 【LeetCode】Jump Game && Jump Game II
- [Leetcode]Jump Game && Jump Game II
- Leetcode之Jump Game & Jump Game II
- Jump Game 和Jump Game II---LeetCode
- LeetCode-Jump Game & Jump Game II
- 【Leetcode】【python】Jump Game/Jump Game II
- LeetCode: Jump Game
- LeetCode: Jump Game II
- LeetCode Jump Game
- LeetCode Jump Game II
- LeetCode : Jump Game
- LeetCode: Jump Game II
- 总结自己这十几年所犯的职场错误
- FEDORA 20尝试了各种安装FCITX拼音的方法,只有一种是可行的
- jQuery Mobile移动开发
- Atitit. C# java 的api 目录封装结构映射总结
- leetcode-Subsets II
- leetcode-Jump Game
- HDU 5046 DLX
- 数论总结
- hdu 1011 树状dp。。
- c++输出缓冲区刷新
- 集合框架3:Set集合
- 居中没有宽度的元素
- 动态连通性算法分析总结
- HashMap和HashTable的区别