Leetcode 45. 跳跃游戏 II

记录n{0…}跳的最大长度，当最大长度大于等于最后位置时，n就是所求值

class Solution {
public:
    int jump(vector<int>& nums) {
        int L = 0, R = 0, n = 0;
        while (R < nums.size() - 1) {
            int M = R;
            for (int k = L; k <= R; ++k)
                M = max(k + nums[k], M);
            L = R + 1, R = M;
            ++n;
        }
        return n;

    }
};