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.
public class Solution { /** * @param A: A list of lists of integers * @return: An integer */ public int jump(int[] A) { // write your code here if(A == null || A.length == 0) return 0; int len = A.length; Integer[] count = new Integer[len]; int max = 0; count[0] = 0; for(int i = 1; i < len; i++) count[i] = null; for(int i = 0; i <= max && i < len; i++){ if(i + A[i] > max){ max = i + A[i]; for(int j = i + 1; j <= max && j < len; j++){ if(count[j] == null) count[j] = count[i] + 1; else count[j] = Math.min(count[j], count[i] + 1); } } } if(max >= len - 1) return count[len - 1]; else return Integer.MAX_VALUE; } }
原文：http://www.cnblogs.com/goblinengineer/p/5315002.html