classSolution{publicbooleancanJump(int[] nums){if(nums.length ==1)returntrue;if(nums[0]==0)returnfalse;int total =0;int len = nums.length;int web =0;while(total < len -1){int max=Integer.MIN_VALUE;int tempWeb =-1;for(int i =1;i <= nums[web];i++){if(web + i >= len)break;if(nums[web+i]>= max){
max = nums[web+i];
tempWeb = web+i;}if(tempWeb +max <= web+i){
max = nums[web+i];
tempWeb = web+i;}}int i = tempWeb - web;
total +=i;
web = tempWeb;System.out.println("web:"+web);System.out.println("total:"+total);if(nums[web]+ web >= len-1)break;if(nums[web]==0&& web != len -1)returnfalse;}returntrue;}}