"Original" Leetcodeoj---jump Game II problem Solving report

Original title Address:

https://oj.leetcode.com/problems/jump-game-ii/

Topic content:

Given an array of non-negative integers, you is initially positioned at the first index of the array.

Each element of the array represents your maximum jump length is 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 and then steps to the last 3 index.)

Method:

Here is more subtle, although with DP hard and greedy complexity is O (n^2), but greed has a constant advantage, and indeed AC. The DP hard solution is the tle.

First initialize the end fin to N-1, then start from scratch, find the first point to reach the end, and update the endpoint to that point, with the number of steps plus 1. Because the point is only one step away from the end point, it is the shortest step through the end.

Repeat until fin is 0

All code:

classSolution { Public:    intJumpintA[],intN) {if(n = =1)            return 0; intFin = n-1; intStep =0;  while(Fin! =0)        {             for(inti =0; I < fin;i++)            {                if(A[i] >= fin-i) {fin=i; Step++;  Break; }            }        }        returnstep; }};

"Original" Leetcodeoj---jump Game II problem Solving report