Jump Game
DescriptionHintsSubmissionsDiscussSolution
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
Example 1:
Input: [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
public class MSB { public static void main(String args[]){ int nums[]=new int[]{3,2,1,0,4}; //测试边界 Solution2 test1=new Solution2(); System.out.println(test1.canJump(nums)); } } //贪心策略1 class Solution{ public boolean canJump(int[] nums) { int pos=nums.length-1; for(int i=nums.length-1;i>=0;i--){ if(nums[i]+i>=pos){ pos=i; } } return pos==0; } } //贪心策略2 class Solution1{ public boolean canJump(int nums[]){ int reach=0; for(int i=0;i< nums.length-1;i++){ if(nums[i]+i>reach){ reach=nums[i]+i; System.out.println(reach); } if(reach<=i){ return false; } } return reach>= nums.length-1; } } //动态规划dp[i]=max(dp[i-1]-1,num[i-1]); class Solution2{ public static boolean canJump(int nums[]){ int dp[]=new int[nums.length]; dp[0]=nums[0]; for(int i=1;i<nums.length;i++){ if(dp[i-1]<=0){ return false; } dp[i]=Math.max(dp[i-1]-1,nums[i]); } return true; } }