LeetCode - Jump Game

https://leetcode.com/problems/jump-game/

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.

思路还是比较简单的，就是在目前能到达的范围里面挨个检查最远能到的地方，然后在更新最远的地方，继续检查，直到最远的地方是末尾index为止。

public class Solution {
    public boolean canJump(int[] A) {
        int furthest = 0;
        int i = 0;
        while(i<A.length && i<=furthest){
            int dest = i+A[i];
            if(dest>furthest) furthest = dest;
            if(furthest >= (A.length-1)) return true;
            i++;
        }
        return false;
    }
}

时间复杂度 O(n)，空间复杂度O(1)