【LeetCode】55.Jump Game(Medium)解题报告

【LeetCode】55.Jump Game(Medium)解题报告

题目地址：https://leetcode.com/problems/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.

Solution:

//Edward shi
//贪心思想(也可以backtracking，复杂度较高,有很多种解法)
//time:O(n)
//space:O(1)
class Solution {
public boolean canJump(int[] nums) {
int max = 0;
for(int i=0 ;i<nums.length ; i++){
if(i>max) return false;
max = Math.max(max,nums[i]+i);
}
return true;
}
}

Date：2018年1月31日