3.30 leetcode 跳跃游戏 (堆/贪心算法)_leetcode 贪心 错位堆柱子

class Solution {
    public boolean canJump(int[] nums) {
        int len = nums.length;
        int max = 0;
        int k = 0;
        for(int i = 0; i< len; i++)
        {
            if(i <= k)
            {
                max = Math.max(max, nums[i]+i);
                k = max;
            }
  
            if(k >= len-1)
            {
                return true;
            }
        }
        return false;
    
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22