LeetCode-Jump Game
来源:互联网 发布:刷流量软件 编辑:程序博客网 时间:2024/06/04 23:24
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
.
Code:
<span style="font-size:14px;">class Solution {public: bool canJump(int A[], int n) { int reach = A[0]; for (int i = 0; i <= reach; ++i) { reach = max(reach, i+A[i]); if (reach >= n-1) return true; } return false; }};</span>
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
- 程序员面试之葵花宝典
- linux C复习:内存管理
- 备注
- cocos2d-x 文件管理分析
- 回溯法搜索总结与常见问题
- LeetCode-Jump Game
- Zabbix agent:cannot allocate shared memory for collect
- kobject_uevent
- Android ActionBar应用实战,高仿微信主界面的设计
- IGeometry接口
- 8.13
- 14年暑假前5日训练总结
- How to check the Gateway address in Windows
- Eclipse输入函数的联想功能