55. Jump Game
2015-06-25 09:44
423 查看
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 =
Hide Tags
Array Greedy
Jump Game II
solution
reach记录从当前位置可以到达的最远位置
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.
Hide Tags
Array Greedy
Jump Game II
solution
reach记录从当前位置可以到达的最远位置
class Solution { public: bool canJump(vector<int>& nums) { int n = nums.size(); int i = 0; for (int reach = 0; i < n && i <= reach; ++i)//i<reach说明i是可以到达的 reach = max(i + nums[i], reach); return i == n; } };
相关文章推荐
- 顺推金额操作
- 关于PHPstorm的代码补全
- tomcat 产生heapdump文件配置
- loadrunner使用备忘录
- jks2pfx-java证书转为.net证书
- C++笔记——虚函数
- 线程与线程池,实例比较。
- GUI编程及文件对话框的使用
- CC_CALLBACK原理及应用
- Xamarin中Render的使用
- Paypal mobile sdk 支付报错
- RGB-D 室内导航 paper
- C++气泡
- PATBasic——1022. D进制的A+B (20)
- Spring25大面试题
- java Socket 文件传输
- 新手入门程序必须克服的5个障碍
- Eclipse 相关操作之快捷键整理
- linux下vi命令大全
- 疯狂安卓讲义第三版安卓源码(最新版的)