classSolution{publicbooleancanJump(int[] nums){int end =0;int maxPosition =0;boolean ans =false;for(int i =0; i < nums.length -1; i++){
maxPosition = Math.max(maxPosition, nums[i]+ i);if( i == maxPosition){break;}if( i == end){
end = maxPosition;}}if(end >= nums.length-1) ans =true;return ans;}}