##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The core idea
Track the furthest reachable position as you iterate.
At each position i, if i > farthest, you can't reach this position. Return false.
Otherwise, update farthest = max(farthest, i + nums[i]).
If you reach the end, return true. This is simpler than Jump Game II because you only need to know if you can reach, not how many jumps.
