class Solution {
public:
int jump(vector<int>& nums) {
int step = 0,max_path =0,end = 0;
for(int i = 0;i < nums.size()-1;i++){
max_path = max(max_path,nums[i]+i);
if(i == end){
end = max_path;
step++;
}
}
return step;
}
};