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.)

思路1 ：设置俩变量，一个存当前到达， 一个存下个到达， 如果 i 大于当前到达， steps++, 如果 i + A[i] > nextReach 更新 nextReach

思路2： Using a array to storage the steps, every time we need to compare the steps to the last step + 1. It will take a long time

思路3： Every time we search from the start to the destination, if it can reach the destination. Jump to this point, then set up the next destination.

/**
 * By Mark Dong
 * Running time O(n)
 * Space O(1)
 */
public class Solution {
    public int jump(int[] A) {
        if(A.length < 2)
            return 0;
        int reach = A[0];
        int nextReach = 0;
        int steps = 1;
        
        for(int i = 0; i < A.length; i++){
            if(reach < i){
                steps++;
                reach = nextReach;
            }
            if(A[i] + i > nextReach){
                nextReach = A[i] + i;
            }
        }
        return steps;
    }
}

public class Solution {
    public int jump(int[] A) {
        int n = A.length;
        int[] dp = new int[n];
        if(n==0)  
        {  
            return 0;  
        }  
        dp = new int[n];  
        dp[0] = 0;  
        for(int i=1;i<n;i++)  
        {  
            dp[i] = Integer.MAX_VALUE;  
        }  
        for(int i=1;i<n;i++)  
        {  
            for(int j=0;j<i;j++)  
            {  
                if(j+A[j]>=i)  
                {  
                    int tmp = dp[j]+1;  
                    if(tmp < dp[i])  
                    {  
                        dp[i] = tmp;  
                        break;  
                    }  
                }  
            }  
        }  
          
        return dp[n-1];
    }
}

public class Solution {
    public int jump(int[] A) {
        int[] steps = new int[A.length];
        for(int i = 0; i < A.length; i++){
            steps[i] = i;
        }
        for(int i = 1; i < A.length; i++){
            for(int j = 0; j < i; j++){
                if(j + A[j] >= i){
                    steps[i] = steps[j] + 1;
                    break;
                }
            }
        }
        return steps[A.length - 1];
    }
}