Leetcode: Jump Game
来源:互联网 发布:淘宝被骗了钱怎么办 编辑:程序博客网 时间:2024/05/18 00: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.
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
.
Greedy.
public class Solution { public boolean canJump(int[] A) { boolean[] can = new boolean[A.length]; can[0] = true; for (int i = 1; i < A.length; i++) { for (int j = 0; j < i; j++) { if (can[j] && A[j] >= (i - j)) { can[i] = true; break; } } } return can[A.length - 1]; }}
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
- MySQL数据库导入到SQL Server
- 随笔--四个月培训小结
- Phoenix Tips (8) 多租户
- socket描述符选项[SOL_SOCKET] 详解
- 如何编写windows服务程序
- Leetcode: Jump Game
- senchatouch之container层注册事件
- 上海历史上有过的 无线电元器件厂和无线电设备厂
- Implement strStr()
- 第十一周项目六 (3+)输出1000以内所有回文素数
- 第十一周项目二 程序填充题之ABCD金字塔
- 学习经历(爬虫)
- POJ3159差分约束(SPFA)
- Android-动画