Leetcode@Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

For example:
Given array A = [2,3,1,1,4]

The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

Anaysis;

This problem is an extension for the jump game, and it is the same idea to solve this problem, we can decide how much we can jump.

in the program , the is a maxTem, and nextTem,  the maxTem is connected with sptes, and the nextTem is to reocrd when we have reached the position, where we can reach.

public class Solution {    public int jump(int[] nums) {      int step = 0;      int maxTem = 0;      int nextTem = 0;      int length = nums.length;      for(int i = 0; i < length; i++){        if(i > maxTem){          step++;          maxTem = nextTem;        }        int tem = i + nums[i];        if(tem > nextTem)          nextTem = tem;      }      return step;    }}