\u4eca\u5929\u8fd9\u4e2a\u662f\u7528\u7684\u8d2a\u5fc3\uff0c\u4e0d\u77e5\u9053\u7b97\u4e0d\u7b97dp\u3002\u3002<\/p>\n\n\n\n
55. \u8df3\u8dc3\u6e38\u620f<\/a><\/p>\n\n\n\n \u6709\u4e24\u4e2a\u6ce8\u610f\u70b9\uff0c\u4e00\u4e2aif(max >= len – 1) return true;\u53e6\u4e00\u4e2a\u662fif(max >= i)\u624d\u8fdb\u5165max\u6bd4\u8f83<\/mark><\/p>\n\n\n\n\/**
<\/em> 55. \u8df3\u8dc3\u6e38\u620f
<\/em> \u7ed9\u5b9a\u4e00\u4e2a\u975e\u8d1f\u6574\u6570\u6570\u7ec4 nums \uff0c\u4f60\u6700\u521d\u4f4d\u4e8e\u6570\u7ec4\u7684 \u7b2c\u4e00\u4e2a\u4e0b\u6807 \u3002
<\/em>
<\/em> \u6570\u7ec4\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u4ee3\u8868\u4f60\u5728\u8be5\u4f4d\u7f6e\u53ef\u4ee5\u8df3\u8dc3\u7684\u6700\u5927\u957f\u5ea6\u3002
<\/em>
<\/em> \u5224\u65ad\u4f60\u662f\u5426\u80fd\u591f\u5230\u8fbe\u6700\u540e\u4e00\u4e2a\u4e0b\u6807\u3002
<\/em>
<\/em>
<\/em>
<\/em> \u793a\u4f8b 1\uff1a
<\/em>
<\/em> \u8f93\u5165\uff1anums = [2,3,1,1,4]
<\/em> \u8f93\u51fa\uff1atrue
<\/em> \u89e3\u91ca\uff1a\u53ef\u4ee5\u5148\u8df3 1 \u6b65\uff0c\u4ece\u4e0b\u6807 0 \u5230\u8fbe\u4e0b\u6807 1, \u7136\u540e\u518d\u4ece\u4e0b\u6807 1 \u8df3 3 \u6b65\u5230\u8fbe\u6700\u540e\u4e00\u4e2a\u4e0b\u6807\u3002
<\/em> \u793a\u4f8b 2\uff1a
<\/em>
<\/em> \u8f93\u5165\uff1anums = [3,2,1,0,4]
<\/em> \u8f93\u51fa\uff1afalse
<\/em> \u89e3\u91ca\uff1a\u65e0\u8bba\u600e\u6837\uff0c\u603b\u4f1a\u5230\u8fbe\u4e0b\u6807\u4e3a 3 \u7684\u4f4d\u7f6e\u3002\u4f46\u8be5\u4e0b\u6807\u7684\u6700\u5927\u8df3\u8dc3\u957f\u5ea6\u662f 0 \uff0c \u6240\u4ee5\u6c38\u8fdc\u4e0d\u53ef\u80fd\u5230\u8fbe\u6700\u540e\u4e00\u4e2a\u4e0b\u6807\u3002
<\/em>
<\/em>
<\/em> \u63d0\u793a\uff1a
<\/em>
<\/em> 1 <= nums.length <= 3 * 10^4
<\/em> 0 <= nums[i] <= 10^5
<\/em>
<\/em> * <\/em>@author <\/em><\/strong>zeroheart
<\/em> *
<\/em> *\/
<\/em>public class Question55 {
public boolean canJump(int[] nums) {
int len = nums.length;
if(len <= 1)return true;
\/\/ \u5f53\u524d\u6700\u8fdc\u80fd\u8df3\u5230\u54ea
int max = nums[0];
for(int i = 0; i<len; i++){
if(max >= len - 1) return true;
if(max >= i){
\/\/ \u9996\u5148\u8981\u80fd\u8df3\u5230i\uff0c\u624d\u6709\u4e0b\u9762\u7684\u8ba1\u7b97
max = Math.max<\/em>(max, i + nums[i]);
}
}
return false;
}
public static void main(String[] args) {
}
}<\/pre>\n\n\n\n