45. Jump Game II leetcode python 2016 new season
来源:互联网 发布:哪点的java培训学校好 编辑:程序博客网 时间:2024/05/29 18:39
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.)
Note:
You can assume that you can always reach the last index.
Have you met this question in a real interview?
Yes
No
Discuss
class Solution(object): def jump(self, nums): """ :type nums: List[int] :rtype: int """ count = 0 last = 0 reach = 0 for i in range(len(nums)): if i > last: last = reach count += 1 reach = max(reach, i + nums[i]) return count
0 0
- 45. Jump Game II leetcode python 2016 new season
- 【Leetcode】【python】Jump Game/Jump Game II
- 45. Jump Game II Leetcode Python
- 40. Combination Sum II leetcode Python 2016 new season
- 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
- 神经网络Tips 和Tricks
- MFC - 切换进程当前的工作目录
- 设计模式之原型模式
- 人工神经网络的深入理解
- C++输入cin,cin.get(),cin.getline()详细比较及例子
- 45. Jump Game II leetcode python 2016 new season
- jquery获取当前单击对象的下一个input标签的值
- 10种思维方式
- CF 86D 莫队(卡常数)
- Linux内核工程导论——网络:路由:路由原理
- FirstScreen首屏跳转
- Linux多线程实践(三)线程的基本属性设置API
- rsyslog安装、配置
- java不可变类中静态成员变量可以改变吗