LeetCode 45. Jump Game II
来源:互联网 发布:青岛灭门案犯落网知乎 编辑:程序博客网 时间:2024/06/06 15:37
描述
问最少多少次可以走到数组最后
解决
用一个数记录当前索引号,然后遍历当前的索引范围,得到下一次遍历的最大索引号
class Solution {public: int jump(vector<int>& nums) { int i = 0; int length = nums.size(); int max_index_now = 0, temp_index = 0, cnt = 0; while (i == 0 || i < length) { if (i > max_index_now) { ++cnt; max_index_now = temp_index; } if (i + nums[i] > max_index_now && i + nums[i] > temp_index) { temp_index = i + nums[i]; } ++i; } return cnt; }};
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
- static class 静态类(Java)
- Java in PowerShell on Windows 10
- etting pink textures in build
- 十一月英语学习
- HDU 5573 Binary Tree 2015ACM/ICPC亚洲区上海站 (构造)
- LeetCode 45. Jump Game II
- 积累的相关资源网址
- DB2 中row_number() over()分析函数用法
- android序列化
- 2.Libgdx扩展学习之Box2D_刚体和形状
- 删除数组零元素
- 1058. 选择题(20)-有点难
- 1130/2016下午
- 小技巧——防止系统出问题文件丢失