1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

		public int jump(int[] nums) {
		    int currentMaxAvailableIndex = 0, end = 0, steps = 0;
		    		for (int i = 0; i < nums.length - 1; i++) {
		    		    			currentMaxAvailableIndex = Math.max(currentMaxAvailableIndex, nums[i] + i);
		    		    			if (i == end) {
		    		    		    				end = currentMaxAvailableIndex;
		    		    		    				steps++;
		    		    			}
		    		}
		    		return steps;
	}