leetcode - Jump Game
来源:互联网 发布:德州扑克辅助软件 编辑:程序博客网 时间:2024/06/07 06:34
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(int A[], int n) {if(n == 0) return false;int s = A[0];for (int i = 1; i < n; i++){if(s > 0){s = std::max(--s,A[i]);}else{return false;}}return true; }};
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
- 线性表实验
- 通过函数申请内存的两个函数剖析(malloc函数讲解)
- Andriod中的依赖注入
- 11111 - Generalized Matrioshkas
- 【Arduino】SD卡模块
- leetcode - Jump Game
- [转] linux下svn常用指令
- thinkphp模板的一个问题
- android 虚拟菜单出不来的解决方法。
- hadoop面试题答案
- C# 编程指南——类型转换
- cocoapods安装与管理
- keil uVision4的安装以及KEIL_Lic.exe的注册
- 解决duilib使用zip换肤卡顿的问题(附将资源集成到程序中的操作方法)