題目鏈接： LeetCode 45 — Jump Game II
AC代碼：
public class PRoblem45 { public static void main(String[] args) { // TODO Auto-generated method stub } public int jump(int[] nums) { if(nums.length<=1) return 0; int now=0; int num=0; while(true){ if(now+nums[now]>=nums.length-1) return num+1; now=judgegood(nums, now); num++; } } public int judgegood(int[] nums,int start){ int n = nums[start]; int max=0,p=start; for(int i=1;i<=n;i++){ if(nums[start+i]+i>max){ max=nums[start+i]+i; p=start+i; } } return p; }}新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
