LeetCode——Jump Game
Description:
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
.
贪心,每次取最大step看是否能够到达最后的索引。
public class Solution { public boolean canJump(int[] nums) { if(nums.length == 0 || nums.length == 1) return true; int maxStep = nums[0]; for(int i=0; i<nums.length; i++) { if(maxStep == 0) { return false; } maxStep = Math.max(maxStep-1, nums[i]); if(maxStep+i >= nums.length-1) { return true; } } return true; } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。