Jump Game II
来源:互联网 发布:office2016 64位mac 编辑:程序博客网 时间:2024/05/17 20:31
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) { int prev = 0, cur = 0, steps = 0; for (int i = 0; i < n; i++) { if (i > cur) { return -1; } if (i > prev) { prev = cur; steps ++; } cur = max(cur, i + A[i]); if (cur >= n - 1) { if (i != n - 1) { steps ++; } break; } } return steps; }};
0 0
- Jump Game &Jump Game II
- Jump Game/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
- Jump Game II
- Jump Game II
- Jump Game II
- leetcode Jump Game II
- [LeetCode]Jump Game II
- Jump Game II
- Jump Game II
- Jump Game II
- Jump Game II
- HDU 3336 (KMP上的dp问题,ac自动机我来了)
- 中国人在菲连遭绑架 作案者中有警察
- cocos2d-x 3.2 |塔防游戏之 加载npc
- SEO必看一些SEO的HTML布局规范知识
- 数据库设计 - 数据库和信息系统
- Jump Game II
- 一致性hash算法 - consistent hashing
- <<Python基础教程>>学习笔记 | 第03章 | 字符串
- 深入理解l操作系统的管程,进程,线程(一)
- Longest Palindrome Substring
- Html(8)继承、特殊性、设置的权值
- Longest Consecutive Sequence
- discount oakley sunglasses outlet online sale-926
- Python利用CookieJar自动处理Cookies