leetcode - Jump Game II

标签：style   color   io   os   ar   for   sp   on   amp   

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

class Solution {
public:
    int jump(int A[], int n) {
        int max = 0;
		int *dp = new int[n];
        memset(dp, 0, sizeof(int) * n);
        for (int i = 0; i < n; i++) {
            for (int j = max - i + 1; j <= A[i] && i + j < n; j++) {
                dp[i + j] = dp[i] + 1;
            } 
            max = max > A[i] + i ? max : A[i] + i;
        }
        return dp[n - 1];
    }
};

leetcode - Jump Game II

标签：style   color   io   os   ar   for   sp   on   amp   

原文地址：http://blog.csdn.net/akibatakuya/article/details/40476111