Jump Game II

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

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 i=0,j=0;
        for(i=1;i<n;i++){
            int far = 0;
            for(int k=0;k<=j;k++) far = max(far, k+A[k]);
            if(far>=n-1) return i;
            if(far<=j) return -1;
            j = far;
        }
        return 0;
    }
};

Jump Game II

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

原文地址：http://www.cnblogs.com/code-swan/p/4142645.html