【LeetCode】55. Jump Game
来源:互联网 发布:php nodejs 共存 编辑:程序博客网 时间:2024/06/08 13:58
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
.
- Difficulty: Medium
时间复杂度O(n)
class Solution {public: bool canJump(vector<int>& nums) { if(nums.size()==0) return true; //if(nums[0]==0) return false; int max=-1; for(int i=0;i<nums.size();i++) { if(nums[i]>max) max=nums[i]; if(max >= nums.size()-i-1) return true; if(max<=0) return false; max--; } return false; }};
0 0
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- 【LeetCode】55. Jump Game
- leetcode 55. Jump Game
- [LeetCode] 55. Jump Game
- LeetCode 55. Jump Game
- LeetCode *** 55. Jump Game
- Leetcode 55. Jump Game
- LeetCode-55.Jump Game
- 算法提高 阮小二买彩票
- 如何提高 C/C++ 编程能力?
- Android 属性动画和View动画的特别之处
- PS笔记--day2
- Android中pendingIntent的深入理解
- 【LeetCode】55. Jump Game
- 使用Samba实现Linus与Windows文件的共享
- windows下 实现radis 集群
- [python3教程]第二章.使用解释器
- PCA降维---python
- poj 3801 Crazy Circuits (有源汇有上下界的最小流)
- C++ 虚函数表解析
- 1分钟完成MySQL5.6生产库自动化安装部署
- boost 1.56.0 编译及使用