[leetcode] Jump Game II
来源:互联网 发布:js定义有返回值的函数 编辑:程序博客网 时间:2024/06/03 19:22
From : https://leetcode.com/problems/jump-game-ii/
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(vector<int>& nums) { int stp = 0, len=nums.size(); if(len <= 1) return 0; for(int i=0; i<len;) { if(nums[i]) { ++stp; } int idx = i+1, far = 0, n=nums[i]+i; if(n+1 >= len) return stp; for(int j=idx; j<=n && j<len; ++j) { if(far < j+nums[j]) { idx = j; far = j+nums[j]; } } i = idx; } return stp; }};
public class Solution { public int jump(int[] nums) { int steps = 0, far = 0; for(int i=0, last=nums.length-1; i<last && nums[i]>0;) { far=i+nums[i]; //最远far if(far >= last) { // 已经能跳到了,那么再条一次 return steps+1; } for(int j=i,curLast=far; j<=curLast; ++j) { if(j+nums[j] > far) { far = j+nums[j]; i = j; } if(far >= last) { break; } } ++steps;//这一条 } return steps; }}
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
- MyBatis之高级关联和集合映射(二、嵌套查询和嵌套结果小案例)
- 文档解析 xml和sax
- 【Struts2框架】第二节Result-动态结果集
- Java基础——面向对象——继承、抽象类、接口、多态、包、内部类、异常等
- github使用教程
- [leetcode] Jump Game II
- Java语言程序设计进阶----第三周作业
- Eclipse调试Logcat类的说明
- 用Pandas作图
- hbase
- Android架构实战(三)—— Retrofit
- 【数据库】分组函数
- 【Struts2框架】第二节Result-向结果传参数
- 简学Oracle