标签：
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.
public class Solution { /** * @param A: A list of integers * @return: The boolean answer */ public boolean canJump(int[] A) { // wirte your code here if(A == null || A.length == 0) return true; int max = 0; for(int i = 0; i <= max && i < A.length; i++){ if(i + A[i] > max) max = i + A[i]; } if(max >= A.length - 1) return true; else return false; } }
标签：
原文地址：http://www.cnblogs.com/goblinengineer/p/5314885.html
