LeetCode Jump Game II
来源:互联网 发布:伤感的网络歌曲大全 编辑:程序博客网 时间:2024/06/05 21:56
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.)
思路:用Max表示[0, i-1]能到达的最远距离,cur表示用ans步到达的距离。那么如果cur<i的话,代表它需要再走一步,所以它就可以到达前i-1能到达的最远距离,可以这么想Max一定是某个位置起跳的,而cur也一定是大于等于Max的起始位置的,因为每个位置的是都是非负数,所以cur一定是>=Max的起始位置的,可以动手写写。
class Solution {public: int jump(int A[], int n) { int ans = 0, Max = 0, cur = 0; for (int i = 0; i < n; i++) { if (cur >= n-1) break; if (cur < i) { ans++; cur = Max; } Max = max(Max, A[i]+i); } return ans; }};
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
- backtrace函数的使用
- Metaio识别图片要求(Image Tracking)
- HttpServletResponse
- NOIP2011 选择客栈
- 观察者模式
- LeetCode Jump Game II
- (操作系统课程项目)系统调用
- Linux内和分析(一)计算机是如何工作的
- C#基础加强
- Samba远程崩溃或代码执行漏洞(CVE-2015-0240)简要分析
- Failed to write core dump. Minidumps are not enabled by default on client versions of Windows
- perf arm交叉编译
- C++ Primer学习总结 第5章 语句
- MySQL 安装(RPM安装模式)及目录结构