LeetCode:Jump Game
来源:互联网 发布:淘宝网买飞机是真是假 编辑:程序博客网 时间:2024/05/14 06:00
Total Accepted: 66496 Total Submissions: 240634 Difficulty: Medium
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:
class Solution {public: bool canJump(vector<int>& nums) { int n = nums.size(); int i=0; for(int reach = 0;i<n && i<=reach;i++) reach = max(reach, i+nums[i]); return i==n; }};
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
- 用Model来计算cell的高度
- Eclipse中,修改文件的默认打开方式
- HTML5新格式
- keepalive 检测web
- MariaDB缓冲区详解
- LeetCode:Jump Game
- 【codeforces #327C】 Magic Five 矩阵高速幂加等比加逆元
- ffmpeg编译for IOS
- Servlet总结
- Qt(安装及首次体验)
- mac线刷Android-红米note
- .NET配置文件中configSections的用法
- Android异常布局的ClassCastException 安卓 LayoutParams castclass
- 寒假集训02 J hdu 5303 DP+枚举