Jump Game
来源:互联网 发布:淘宝店尾页区域怎么改 编辑:程序博客网 时间:2024/06/05 06: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
.
//http://tech.ddvip.com/2014-08/1407731415212434.html//http://www.cnblogs.com/ganganloveu/p/3761715.htmlclass Solution {public: int jump(vector<int>& nums) { int n = nums.size(); int ret = 0; int curRch = 0; int curMax = 0; for(int i = 0;i<n;i++) { if(curRch < i) { ret++; curRch = curMax; } curMax = max(curMax,nums[i] + i); } return ret; }};
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
- Lazy<T>
- 微软校招2015 Beautiful String
- android intent
- 命令模式command
- x264参数介绍(二、分析和视频可用性信息)
- Jump Game
- Java之LinkedList详解
- SQL行列转换实例
- lua正则式
- Android数据库 之 SQLite数据库
- Android studio简单设置
- 算法概念:大O表示法/小o表示法/Ω/Θ
- Latex之安装宏包
- Android开源项目分类汇总