55_Jump_Game.java

classSolution {
publicbooleancanJump(int[] nums) {
intfurthestSoFar = 0, goal = nums.length - 1;

for (inti = 0; i <= furthestSoFar && furthestSoFar < goal; i++) {
furthestSoFar = Math.max(furthestSoFar, nums[i] + i);
 }

returnfurthestSoFar >= goal;
 }
}