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

Hide Tags

  Array Greedy

翻译：

Discuss

/**
 * 
 */
package From41;

/**
 * @author MohnSnow
 * @time 2015年6月24日 上午9:27:29
 * @url https://leetcode.com/problems/jump-game-ii/
 * @title Jump Game II
 * @trans 只需要时刻计算前位置和当前位置所能跳的最远长度,并始终和n作比较就可以:
 */
public class LeetCode45 {

	/**
	 * @param argsmengdx
	 *            -fnst
	 */
	//https://leetcode.com/discuss/30647/single-loop-simple-java-solution
	//372msAC
	public static int jump(int[] A) {
		int step_count = 0;//目前为止的jump数
		int last_jump_max = 0;//从A[0]进行ret次jump之后达到的最大范围
		int current_jump_max = 0;//从0~i这i+1个A元素中能达到的最大范围
		for (int i = 0; i < A.length - 1; i++) {
			current_jump_max = Math.max(current_jump_max, i + A[i]);
			if (i == last_jump_max) {//当前最少步数可以到达的
				step_count++;
				last_jump_max = current_jump_max;
			}
			System.out.println("i: " + i + " step_count: " + step_count + " current_jump_max: "
					+ current_jump_max + " last_jump_max: " + last_jump_max);
		}
		return step_count;
	}

	public static int jump1(int[] nums) {
		int len = nums.length;
		int i = 0;
		while (i < len) {
			if (nums[i] == 0) {
				return -1;
			} else {
				i++;
			}
		}
		return 0;
	}

	public static void main(String[] args) {
		int[] nums = { 1, 2, 7, 3, 4, 7, 2, 4 };
		System.out.println("走几步: " + jump(nums));
	}
}