[leetcode]Jump Game II
来源:互联网 发布:t22被砍后数据 编辑:程序博客网 时间:2024/06/09 15:05
45. 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.)
这是我的解法,思路类似于这个discuss,将此问题看做bfs.
int jump(vector<int>& nums){ int N = nums.size(); if (N <= 1) return 0; // right is the right bound for this level // cover is the right bound for next level int right = 0 + nums[0], step = 1, cover = right; for (int i = 1; i <= right; ++i) { if (right >= N - 1) return step; cover = max(nums[i] + i, cover); if (i == right) { right = cover; ++step; } } return 0;}
阅读全文
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
- 简单的算法问题3——元素移除
- 第三十二天 :js实现换肤功能(最简版+修改版)
- android中进度条控件
- 学习笔记——JAVA动态编译
- MUI(2)
- [leetcode]Jump Game II
- 错误
- mysql-5.5.56免安装版配置方法
- Java基础应用之循环控制(终止循环体)
- typename和class
- Android程序猿带你学python第5章--输入与输出(I/O)
- MUI(1)
- C笔记 联合体 枚举
- 愿你一切从头做起---Android test