【LeetCode】45. Jump Game II
来源:互联网 发布:淘宝采集软件能赚钱吗 编辑:程序博客网 时间:2024/06/07 06:30
- Difficulty: Hard
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.)
Note:
You can assume that you can always reach the last index.
分析
贪心法,时间复杂度O(n)
class Solution {public:int jump(const vector<int>& nums) {int step = 0; int left = 0;int right = 0;if (nums.size() == 1) return 0;while (left <= right) {++step;const int old_right = right;for (int i = left; i <= old_right; ++i) {int new_right = i + nums[i];if (new_right >= nums.size() - 1) return step;if (new_right > right) right = new_right;}left = old_right + 1;}return 0;}};
0 0
- LeetCode --- 45. Jump Game II
- LeetCode 45.Jump Game II
- [Leetcode] 45. Jump Game II
- [leetcode] 45.Jump Game II
- [leetcode] 45.Jump Game II
- leetcode 45. Jump Game II
- LeetCode 45. Jump Game II
- LeetCode 45. Jump Game II
- leetcode.45. Jump Game II
- leetcode 45. Jump Game II
- leetcode 45. Jump Game II
- [LeetCode] 45. Jump Game II
- LeetCode 45. Jump Game II
- leetcode 45.Jump Game II
- leetcode 45. Jump Game II
- 【leetcode】45. Jump Game II
- LeetCode 45. Jump Game II
- LeetCode 45. Jump Game II
- 使用webservice进行数据的传递
- 反射基础-笔记01
- POJ 1265Area(几何应用)
- 用viewPager实现简易循环播放页
- 笔试题8. LeetCode OJ (8) Nim Game
- 【LeetCode】45. Jump Game II
- [HDU1573]X问题(扩展中国剩余定理)
- [Jsp] 大作业之《课堂帮》
- 常见的web攻击手段
- (一)情感分析-应用场景-商业价值
- Swift / Objective_C / Xcode实际开发中可能遇到的小功能小技巧总结<持续添加更新...>
- Atom:一些有用的Packages和插件
- 关于WampSever的localhost网页不显示等问题
- 挨踢部落第一期:Spark离线分析维度