There are a number of tiles on the floor, each numbered with a different non-negative integer. Treat this set of tiles as an array You are initially standing on the best teach tile in the set represents your maximum jumping distance at that position. (For example, if you are standing on 3, you can jump up to 3 tiles forward). Find out if you can c the last tile. Language: Java Test Input 11231 15,0,0.01

`import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ Scanner sc = new Scanner(System.in); String input = sc.nextLine(); String[] nums = input.split(""); int[] numbers = new int[nums.length]; double[] prob = new double[nums.length]; boolean b = true; int index = 0; for(int i = 0; i < nums.length; i++){ numbers[i] = Integer.parseInt(nums[i]); } for(int i = 0; i < numbers.length; i++){ prob[i] = sc.nextDouble(); } int maxDiff = 0; for(int i = 0; i < numbers.length; i++){ if(i + numbers[i] > max`