LeetCode Jump Game
来源:互联网 发布:程序员压力大吗 编辑:程序博客网 时间:2024/06/18 00:21
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(vector<int>& nums) { if(nums.size() < 2) return true; int pos=0,currentMax=0,nextMax=0; while(currentMax-pos+1 >0) { for(;pos<=currentMax;pos++) { if(pos+nums[pos] > nextMax) nextMax = pos+nums[pos]; if(nextMax >= nums.size()-1) return true; } currentMax = nextMax; } return false; } };
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
- Android Studio介绍与基本设置
- Navicat快捷键
- 部署维护docker环境
- 装箱,拆箱,枚举,Tostring())
- 《跟我一起写makefile》(笔记5--makefile中的条件判断和库文件使用)
- LeetCode Jump Game
- 第28篇 一对多自由控制语音(七)及PHP 数据库ODBC
- linux的vi编辑器
- uvm_void的理解
- 储君资源密码管理
- zoj Circle
- TCP长连接&TCP保活功能
- Android 判断当前设备是手机还是平板
- 联想笔记本y430p加固态硬盘/ssd(M.2)