55.跳跃游戏

贪心

时间复杂度$O(n)$

空间复杂度$O(1)$

class Solution {
    public boolean canJump(int[] nums) {
        int right = 0, n = nums.length;
        for (int i = 0; i < n && i <= right; ++i) {
            right = Math.max(right, i + nums[i]);
            if (right >= n - 1) {
                break;
            }
        }
        return right >= n - 1;
    }
}