leetcode 045 —— Jump Game II
来源:互联网 发布:四川网络大学 编辑:程序博客网 时间:2024/05/21 19:22
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.)
思路:贪心算法,记录之前 所能到达的最远距离last,现在所能到达的最远距离cur。
class Solution {public:int jump(vector<int>& nums) {int res(0);int last(0); //之前记录的所能到达的最远,如果i小于这个数int cur(0);//for (int i = 0; i < nums.size() && i <= cur; i++){if (i>last){ //如果i已经前进到 超过了 之前所能达到的最远处,那个就可以更新last,并且跳跃数也能+1.last = cur;res++;}cur = max(cur, nums[i] + i);}return res;}};
0 0
- leetcode 045 —— Jump Game II
- leetcode——Jump Game II
- LeetCode 045 Jump Game II
- [LeetCode]045-Jump Game II
- LeetCode 045 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
- linux-ubantu查看已安装的软件
- nandflash详解(不错)
- 如何在JavaFX的WebView中通过JavaScript回调Java的程序
- 将一个正整数转换成2进制并输出
- linux下自启动文件的设置
- leetcode 045 —— Jump Game II
- [ASP.NET MVC 小牛之路]15 - Model Binding
- PowerDesigner学习笔记
- 开始写技术博客了,请大家关注
- 操作系统原理学习笔记--进程管理
- 2012年5月SAT香港真题解析
- 修改linux的hostname
- QT添加图标
- [ASP.NET MVC 小牛之路]16 - Model 验证