class Solution {
public:
bool canJump(int A[], int n) {
int reach=A[0];
for(int i=0;i<=reach&&reach<n;i++)
reach=max(reach,i+A[i]);
return reach>=n-1;
}
};
class Solution {
public:
bool canJump(int A[], int n) {
int reach=A[0];
for(int i=0;i<=reach&&reach<n;i++)
reach=max(reach,i+A[i]);
return reach>=n-1;
}
};
题目链接 https://leetcode.com/problems/jump-game/description/...
https://leetcode.com/problems/jump-game/#/description Giv...
原题地址 https://leetcode.com/problems/jump-game/description/...
题目地址 https://leetcode.com/problems/jump-game/description/...
题目地址： https://leetcode-cn.com/problems/jump-game/[https:...
题目地址 https://leetcode-cn.com/problems/jump-game/[https://...
题目描述 链接：https://leetcode-cn.com/problems/jump-game/[https...
55. 跳跃游戏[https://leetcode-cn.com/problems/jump-game/] 动态规...
题目链接 https://leetcode.com/problems/jump-game/ 解题思路 贪心求解。 代码
本文标题：jump-game
本文链接：https://www.haomeiwen.com/subject/cqkdlctx.html
网友评论