Leetcode--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

Have you met this question in a real interview

思路：先判断数组是否能够跳跃到最后一个数组元素，若能，则求最小跳数。

最小跳数的求法：采取贪心选择，每次不是跳到当前能够达到的最远元素（不是A[i]+i），而是跳到 下一跳能跳最远的元素去，更新当前最远能跳位置的值。

class Solution {
public:
        bool canJump(int A[], int n,int dp[]) {
        if(n<2)
            return true;
        int pos=0;
        //int dp[n];
        memset(dp,0,sizeof(int)*n);
        dp[0]=A[0];
        for(int i=1;i<n-1;i++)
        {
            if(i>dp[i-1])
                return false;
            else{
                if(dp[i-1]>i+A[i])
                    dp[i]=dp[i-1];
                else
                    dp[i]=i+A[i];
                    
                if(dp[i]>=n-1)
                    return true;
            }
        }
        
        if(dp[n-2]>=n-1)
            return true;
        else
            return false;
        
    }
    int jump(int A[], int n) {
        int *dp=new int[n];
        memset(dp,0,sizeof(int)*n);
        bool judge=canJump(A,n,dp);
        if(judge==false)
            return -1;
        else
        {
            int max=0;
            int num=0;
            int temp=0;
            for(int i=0;i<n;)
            {
                if(max>=n-1)
                    break;
                
                while(i<=max)
                {
                    if(i+A[i]>temp)
                        temp=i+A[i];
                    i++;
                }
                
                max=temp;
                num++;
                
            }
            return num;
        }
    }
};