This solution looks like Prim's algorithm.
- jump to the furthest reachable point
- update
maxjumplike Jump Game count = count + 1- loop until reach the end
Files
jump-game-ii
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
This solution looks like Prim's algorithm.
maxjump like Jump Gamecount = count + 1