贪心:
题目描述:
给出一个非负整数数组,你最初在数组第一个元素的位置
数组中的元素代表你在这个位置可以跳跃的最大长度
判断你是否能到达数组最后一个元素的位置
例如
A =[2,3,1,1,4], 返回 true.
A =[3,2,1,0,4], 返回 false.
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], returntrue.
A =[3,2,1,0,4], returnfalse.
输入描述:
输出描述:
示例1:
输入:
输出:
代码:
public class Solution {
public boolean canJump(int[] A) {
int curFast = 0;
for (int i = 0; i < A.length - 1; i++) {
if (i <= curFast)
curFast = Math.max(curFast, i + A[i]);
}
if (curFast >= A.length - 1)
return true;
else
return false;
}
}