Jump Game - LeetCode
来源:互联网 发布:parse解析json字符串 编辑:程序博客网 时间:2024/05/24 07:26
Jump Game - LeetCode
题目:
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
.
分析:
这道题虽然被LeetCode划为贪婪,但是我用的是动态规划。循环整个A,每一点都计算这一点能到的最远距离,即i+A[i],如果当循环到一点发现,上一次计算的最远距离比该点index小,则退出循环,看是否最远距离大于整个A的长度,如果大于返回True,小于则返回False。
代码:
class Solution: # @param A, a list of integers # @return a boolean def canJump(self, A): if not A: return False res = 0 for i in xrange(len(A)-1): if i > res: break res = max(res,A[i]+i) if res < len(A)-1: return False return True
0 0
- LeetCode Jump Game && Jump GameII
- [LeetCode]Jump Game II、Jump Game
- 【LeetCode】Jump Game & Jump Game II
- leetcode Jump Game & Jump Game II
- leetcode之Jump Game && Jump Game II
- [leetcode]Jump Game &&Jump Game II
- 【LeetCode】Jump Game && Jump Game II
- [Leetcode]Jump Game && Jump Game II
- Leetcode之Jump Game & Jump Game II
- Jump Game 和Jump Game II---LeetCode
- LeetCode-Jump Game & Jump Game II
- 【Leetcode】【python】Jump Game/Jump Game II
- LeetCode: Jump Game
- LeetCode: Jump Game II
- LeetCode Jump Game
- LeetCode Jump Game II
- LeetCode : Jump Game
- LeetCode: Jump Game II
- XML解析
- java 集合Map架构
- 并发编程的几点
- 云核算广泛的使用场景发展意义
- Libevent源码分析-----内存分配
- Jump Game - LeetCode
- 算法--库函数实现全排列
- system.badimageformatexception 未能加载文件或程序集
- 背包解决硬币问题专题
- JAVA 集合类
- 如何进行用户体验的评估分析
- 进程与线程的区别与联系
- Objective-c基础
- day01总结