leetcode 055 Jump Game
来源:互联网 发布:省流量的软件 编辑:程序博客网 时间:2024/05/17 23:43
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
.
Subscribe to see which companies asked this question
class Solution {public: bool canJump(vector<int>& nums) { int len = nums.size();int ans = 0;if(len == 0) return true;ans = nums[0];//dp[i+1] = max(dp[i]-1, nums[i-1]-1) dp[0] = nums[0]for(int i=1; i < len; i++) {ans = max(ans-1, nums[i-1]-1);if (ans < 0) return false;//cout << ans << endl;}if(ans >= 0) return true;else return false; }};
0 0
- LeetCode 055 Jump Game
- LeetCode 055 Jump Game
- LeetCode 055 Jump Game
- leetcode 055 Jump Game
- LeetCode 055 Jump Game
- LeetCode(055) Jump Game (Java)
- LeetCode Jump Game && Jump GameII
- leetcode 055 —— Jump Game
- [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
- org.apache.hadoop.mapred.FileAlreadyExistsException: Output directory hdfs://mycluster/output alread
- JavaSE入门学习34:Java集合框架之Collection接口、子接口及其实现类
- Struts中ActionContext和ServletActionContext的比较 [转]
- c#调用c++制作的基于mfc的ocx控件
- enjoy_game服务端
- leetcode 055 Jump Game
- Object-C 中各数据类型转换 NSData转NSString,Byte,UIImage
- UIView
- 【Stanford机器学习笔记】4-Regularization for Solving the Problem of Overfitting
- Java封装(修饰符+包+内部类)
- storyBoard正传逆传代理解耦
- Light Oj 1284 Lights inside 3D Grid(概率期望)
- 递归反转字符串
- iOS系统通讯录授权,获取,修改,创建联系人