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

设置dp[i]数组 为跳到i需要需要几步，dp[i]是递增的，不存在前面一个需要跳转的比后一个需要多跳。dp[0]=0

i从1开始遍历，求得dp[i]。方法：将0到i的数遍历，如果j+A[j]<i，说明可以到达i. 那么第一个到达i，所求的dp[i]=dp[j]+1一定是最小的，一次就break

class Solution {
public:
    int jump(int A[], int n) {
        int dp[n];
        dp[0]=0;
        for(int i=1; i<n; i++){
            dp[i]=n;
        }
        for(int i=1; i<n; i++){
            for(int j=0; j<i; j++){
                if(j+A[j]>=i){
                    if(dp[j]+1<dp[i]){
                        dp[i]=dp[j]+1;
                        break;//为什么可以break
                    }
                }
            }
        }
        return dp[n-1];
    }
};