没太理解
class Solution {
public:
int jump(vector<int>& nums) {
//011122223333444
if(nums.size() == 1) return 0;
int l = 0, r = 0, step = 0;
while(l <= r){
int max_r = 0;
for(int i = l; i <= r; i++)
max_r = max(max_r, nums[i] + i);
step++;
l = r+1, r = max_r;
if(r >= (int)nums.size() - 1) break;
}
return step;
}
};