Leetcode|中等|区间贪心|45. 跳跃游戏II

class Solution {
public:
    int jump(vector<int>& nums) {
        int size = nums.size();
        // 当前覆盖终点索引
        int cover = 0;
        int fastTarget = 0, count = 0; 
        // 注意：i∈[0, size - 2]
        for (int i = 0; i < size - 1; i++) {
            fastTarget = max(fastTarget, i + nums[i]);
            // 到达当前覆盖终点时，计数器+1，准备遍历下一段覆盖
            if (i == cover) {
                count++;
                cover = fastTarget;
            }
        }
        return count;
    }
};