LeetCode: Jump Game II
来源:互联网 发布:size_t linux 编辑:程序博客网 时间:2024/05/08 15:41
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.)
class Solution {public: int jump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n <= 1) return 0; int minStep = 0; int maxLen = 0; int i = 0; while (i < n) { if (A[i] > 0) ++minStep; else return 0; // 当前所能达到的最远距离 maxLen = A[i] + i; if (maxLen >= n-1) return minStep; int tmp = 0; // 下一步所能达到最远距离的起始坐标 for (int j = i + 1; j <= maxLen; ++j) { if (tmp <= A[j] + j) { tmp = A[j] + j; i = j; } } } return minStep; }};
- 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
- Using Renewable Energy in the Data Center
- JBPM4.4安装(Tomcat-MySQL)
- 更新ListView某一行
- 2012.10.07 安卓游戏开发笔记(十二)_SurfaceView视图
- Android SurfaceView 的基本应用
- LeetCode: Jump Game II
- 关于kprobe的几种使用
- java第三周--(输出任意数之间的所有完数;3位数的任意整数,输出其降序数)
- Linux系统shell脚本判断变量文件目录:权限、是否存在、空值、相等
- 求a的n次方,要求快速算法
- JS劫持
- ORACLE的基本语法
- 横竖屏切换时候Activity的生命周期
- 几个注意的小算法