LEETCODE: Jump Game II
来源:互联网 发布:以前java上的石器时代 编辑:程序博客网 时间:2024/06/04 19: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.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A = [2,3,1,1,4]
The minimum number of jumps to reach the last index is 2
. (Jump 1
step from index 0 to 1, then 3
steps to the last index.)
class Solution {public: int jump(int A[], int n) { if(n <= 1) return 0; int max = A[0]; int step = 1; int pos = 0; while(max < n - 1) { int lastmax = max; for(int ii = pos + 1; ii < lastmax + 1; ii ++) { if(max < A[ii] + ii) { max = A[ii] + ii; } } step ++; } return step; }};
0 0
- LeetCode: Jump Game II
- LeetCode Jump Game II
- LeetCode: Jump Game II
- [Leetcode] Jump Game II
- [LeetCode] Jump Game II
- [Leetcode] Jump Game ii
- leetcode Jump Game II
- leetcode Jump Game II
- [LeetCode]Jump Game II
- [leetcode]Jump Game II
- LeetCode-Jump Game II
- [leetcode] Jump Game II
- LeetCode - Jump Game II
- LeetCode:Jump Game II
- LeetCode | Jump Game II
- 【Leetcode】Jump Game II
- LeetCode Jump Game II
- [LeetCode] Jump Game II
- Oracle中Round()和Trunc()用法
- kettle-engine.jar与 log4j.jar包冲突问题解决办法
- OSChina 的URL重写处理类源码
- Android:调用系统图库/裁剪图片
- 毁掉企业的十大管理神话
- LEETCODE: Jump Game II
- MAC mysql安装及设置
- Android中RelativeLayout各个属性的含义
- java里list,set,Map的区别
- IOS开发之 ---- IOS8推送消息注册
- xpath路径表达式笔记
- Ubuntu 12.04下安装VMware Tools遇到的问题 .
- Freemarker入门案例
- 脚本练习_比较长