leetcode : jumpgame
来源:互联网 发布:淘宝网运动鞋女 编辑:程序博客网 时间:2024/05/20 06:28
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], returntrue.
A =[3,2,1,0,4], returnfalse.
class Solution {
public:
bool canJump(int A[], int n) {
int reach = 1;
for(int i = 0; i< reach && reach<n;i++)
{
reach = max(reach, i+1+A[i]);
}
return reach>=n;
}
};
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], returntrue.
A =[3,2,1,0,4], returnfalse.
class Solution {
public:
bool canJump(int A[], int n) {
int reach = 1;
for(int i = 0; i< reach && reach<n;i++)
{
reach = max(reach, i+1+A[i]);
}
return reach>=n;
}
};
0 0
- leetcode JumpGame
- leetcode--JumpGame
- leetcode--JumpGame
- leetcode : jumpgame
- LeetCode JumpGame and JumpGame II
- leetcode jumpgame 2
- leetcode解题方案--055--jumpGame
- jumpgame
- LeetCode No.45 JumpGame 2 题解
- JumpGame II
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- okhttp用法
- hdu5492(递推+数学)
- Spring Validation(使用Hibernate Validator)
- 递归算法的优化思路和CPS
- iframe加载顺序导致数据访问出现问题
- leetcode : jumpgame
- MAC地址和IP地址
- TYVJ1415 差分约束
- TPL——开始一个Task
- nodejs操作MSSQL两种方式--笔记
- 设计模式学习笔记——观察者模式
- pat1014 Waiting in line
- 357. Count Numbers with Unique Digits
- java运行顺序