55. Jump Game 【M】【66】
来源:互联网 发布:云计算软件 编辑:程序博客网 时间:2024/06/05 23:27
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.
Determine if you are able to reach the last index.
For example:
A = [2,3,1,1,4]
, return true
.
A = [3,2,1,0,4]
, return false
.
Subscribe to see which companies asked this question
贪心法,首先计算每个位置能够达到的最远的位置
然后用res表示当前位置能够走道的最远位置,每次循环的时候,直接取[i,res]之间的最大值,更新res
如果res达到最后一个元素,那么就是成功
class Solution(object): def canJump(self, nums): if len(nums) == 1: return True for i in xrange(len(nums)): nums[i] += i res = nums[0] i = 1 goal = len(nums) - 1 while i <= res: if i == res: res = max(res,nums[i]) i += 1 else: i,res = res,max(nums[i:res+1]) if res >= goal: return True return False
0 0
- 55. Jump Game 【M】【66】
- leetcode-m-Jump Game
- LeetCode-M-Jump Game
- 55. Jump Game && 45. Jump Game II
- 55. Jump Game. 45. Jump Game II
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- 55. Jump Game
- 55. Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- 55. Jump Game
- leetcode 55. Jump Game
- 224. Basic Calculator
- 解决Linux c语言运行时候“段错误 (核心已转储)”问题-采用gdb 解决
- 【数据结构】之二叉树的java实现
- 一张图看懂UML类图
- Dome projection using a spherical mirror
- 55. Jump Game 【M】【66】
- HDU-5045 Contest(状压DP)
- JavaEE中的Cookie与Session
- poj 2184 变相背包
- Linux上搭建nginx,及简单配置
- jQuery给动态添加的元素绑定事件的方法
- hdu 2087 水kmp
- Java程序员的成长路程
- 创建maven项目,有3个目录没有显示,也新建不了,解决