[LeetCode]Jump Game
来源:互联网 发布:河北奇速网络 编辑:程序博客网 时间:2024/06/06 14:09
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
.
public class Solution { public boolean canJump(int[] A) { for(int i=A.length-2;i>=0;i--){ if(A[i]==0){ boolean oneStep = false; for(int j = i-1;j>=0;j--){ if(A[j]+j>i){ oneStep = true; i = j; break; } } if(!oneStep) 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
- C语言-指针
- centos下打造c++编程IDE环境
- 如何才能学好程序?
- 我内网我我我我
- ByteArrayOutputStream用法
- [LeetCode]Jump Game
- 如何用 SQL Tuning Advisor (STA) 优化SQL语句
- 《Linux程序设计》——调试
- HTML中行内元素与块级元素有哪些及区别 (网易博客)
- VS2010中srand和rand产生随机数的用法
- trie树(字典树)&& 后缀树
- 第7周项目1-电阻串联
- Linux常用命令
- hibernate: 用Disjunction和Conjunction构造复杂的查询条件