标签：
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.
一开始用的双重for循环，但是提交的时候报了个超时的错误，
public class Solution { /** * @param A: A list of integers * @return: The boolean answer */ public boolean canJump(int[] A) { boolean[] reachable = new boolean[A.length]; reachable[0] = true; for (int i = 1; i< A.length; i++) { for (int j = 0; j < i; j++) { if (reachable[j] && j + A[j] >= i) { reachable[i] = true; break; } } } return reachable[A.length - 1]; } }
变成一个for循环提交成功。
public class Solution { public boolean canJump(int[] nums) { if (nums.length <= 1) { return true; } int max = nums[0]; for (int i = 0; i< nums.length; i++) { if (max <= i && nums[i] == 0) { return false; } if (nums[i] + i > max) { max = nums[i] + i; } if (max >= nums.length - 1){ return true; } } return false; } }
标签：
原文地址：http://www.cnblogs.com/iwangzheng/p/5790570.html
