首页 > 代码库 > Leetcode-Jump Game
Leetcode-Jump Game
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.
Have you met this question in a real interview?
Analysis:
We record the max reachable length and update it at each A[i].
1. If maxReach<i, then cannot reach i return false;
2. If maxReach<i+A[i], then we update the maxReach to i+A[i].
3. Once maxReach>=A.length-1, we can reach the end, return true.
Solution:
1 public class Solution { 2 public boolean canJump(int[] A) { 3 if (A.length==0 || A.length==1) return true; 4 int len = A.length; 5 6 int maxReach = A[0]; 7 for (int i=1;i<len;i++) 8 if (maxReach<i) 9 return false;10 else {11 if (maxReach<i+A[i]) maxReach = i+A[i];12 if (maxReach>=len-1) return true;13 }14 15 return false; 16 }17 }
Leetcode-Jump Game
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。