【LeetCode】 jump game I,II解析
来源:互联网 发布:投影互动软件破解 编辑:程序博客网 时间:2024/04/30 09:16
/************************************************************************
*
* 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.
*
*
************************************************************************/
//only pass one time ,get the maxreach class Solution {public: bool canJump(vector<int>& nums) { int n=nums.size(),maxreach=0; for (int i=0; i < n && i <= maxreach && maxreach < n - 1; ++i) maxreach = max(maxreach,i+nums[i]); return maxreach>=n-1; }};
/************************************************************************
*
* 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 i = 0, n = nums.size(), step = 0, end = 0, maxend = 0; while (end < n - 1) { step++; for (;i <= end; i++) { maxend = max(maxend, i + nums[i]); if (maxend >= n - 1) return step; } if(end == maxend) break; end = maxend; } return n == 1 ? 0 : -1; }};
- 【LeetCode】 jump game I,II解析
- [leetcode]Jump Game I II
- LeetCode:Jump Game I && II
- Jump Game I and II leetcode
- [leetcode] Jump Game I and II
- LeetCode 45/55. Jump Game i, ii
- Jump Game I , II
- jump game I // II
- Jump Game I,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
- STM32的STM32F10X_MD_VL和STM32F10X_MD有什么区别呀
- Scrapy+Selenium+Phantomjs的Demo
- [LeetCode]Happy Number(Java)
- 【matlab】求图像的最大连通区域
- Java内部类------匿名内部类
- 【LeetCode】 jump game I,II解析
- 为什么要使用集合框架,集合框架和数组的区别
- 数据查询网址汇总_数学建模系列
- 微服务架构模式系列文章之四:客户端服务发现
- 半年总结-思想
- 玩转java反射
- linux 安装nginx
- jvm开启垃圾回收日志记录
- 《数据结构与算法分析》学习笔记