Leetcode-Jump Game
来源:互联网 发布:js点击加号输入框加一 编辑:程序博客网 时间:2024/06/06 17:49
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(vector<int>& nums) { int i =0; for(int reach=0;i<nums.size()&&i<=reach;i++){ reach = max(i+nums[i],reach); } return i==nums.size(); }};
阅读全文
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
- HTTP Cookie
- Vue2 向Vue.extend传参-propsData属性
- 算法提高 7-2求arccos值
- BZOJ 1426: 收集邮票 期望
- leetcode 154. Find Minimum in Rotated Sorted Array II
- Leetcode-Jump Game
- df
- 修改最大线程数的配置
- Android静默安装实现方案
- Eclipse中的创建maven项目,无法添加src/main/java等source folder
- 数字证书原理
- Android弹窗合集(PopupWindow,dialog)
- FastDFS安装、配置、部署(一)
- WebService接口开发的实例