Jump Game
来源:互联网 发布:苏州餐饮软件sjzpos 编辑:程序博客网 时间:2024/05/29 03:56
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
.
Solution:
class Solution {public: bool canJump(vector<int>& nums) { int len = nums.size(); if(len <= 1) return true; int start = 0, far = nums[0]; while(start < len) { if(start == far) { if(!nums[start]) return false; else { far += nums[start]; if(far >= len - 1) return true; } } else { far = max(far, start + nums[start]); if(far >= len - 1) return true; } start++; } }};
0 0
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- 面试搜集
- 种一棵树最好的时机是十年前,其次是现在
- HDU 2015 偶数求和(水~)
- HDU 2016 数据的交换输出(水~)
- iOS开发UI篇—字典转模型
- Jump Game
- HDU 2017 字符串统计(水~)
- 三分钟理解“建造者模式”——设计模式轻松掌握
- 数据结构:二叉树的实现(C++)
- Ted2
- C++ 异步回调
- 常见错误之java.lang.IllegalStateException: The application’s PagerAdapter changed the adapter’s cont。。。
- Fagment 与 Fragment之间通信(交互)
- Log4j日志配置