leetcode:Jump Game
来源:互联网 发布:程序员和产品经理对骂 编辑:程序博客网 时间:2024/05/07 23:25
给出一维数组,A[i]表示在第i个位置可以最大步跃为A[i],问是否可以调到数组的末端
public class Solution { public boolean canJump(int[] A) { int max = A[0]; for(int i = 0; i <= max; ++i){ if(A[i] + i >= max){ max = A[i] + i; if(max >= A.length - 1){ return true; } } } 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
- 关系数据库三大范式详细剖析
- spring管理bean的原理
- 赵雅智_android系统联系人app分析并获取数据
- 黑马程序员-day07-面向对象(继承和final关键字)
- Linux 源码阅读工具----------Source Insight 经典教程
- leetcode:Jump Game
- 黑马程序员_Java的socket编程
- 解决Ubuntu 14.04安装Adobe Reader9.5无法运行的问题
- Acdreamoj1115(数学思维题)
- POJ-2492(DFS)
- 独立任务最优调度问题
- 读《OSGI与Equinox创建高度模块化的Java系统》笔记(一)eclipse环境搭建和简单事例
- 正则表达式与模版解析的性能比较
- Matrix Factorization, Algorithms, Applications, and Avaliable packages