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

最新推荐文章于 2022-07-21 14:16:03 发布

郝春雨

最新推荐文章于 2022-07-21 14:16:03 发布

阅读量186

点赞数

分类专栏： LeetCode Array 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79214813

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【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;
    }
}