题目:
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.
Example 1:
Input: [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
题解:
很巧妙的解法,代码很短,看着一眼就能看懂。
代码如下:
public class JumpGame
{
public static void main(String[] args)
{
/**
* Example 1:
* Input: [2,3,1,1,4]
* Output: true
* Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
*/
int[] nums1 = { 2, 3, 1, 1, 4 };
System.out.println(canJump(nums1));
/**
* Example 2:
* Input: [3,2,1,0,4]
* Output: false
* Explanation: You will always arrive at index 3 no matter what. Its maximum
* jump length is 0, which makes it impossible to reach the last index.
*/
int[] nums2 = { 3, 2, 1, 0, 4 };
System.out.println(canJump(nums2));
}
public static boolean canJump(int[] nums)
{
int maxCover = 0;
for (int start = 0; start <= maxCover && start < nums.length; start++)
{
if (nums[start] + start > maxCover)
maxCover = nums[start] + start;
if (maxCover >= nums.length - 1)
return true;
}
return false;
}
}