LeetCode Top 100 Liked Questions 55. Jump Game (Java版; Medium)
题目描述
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.
//贪心classSolution{publicbooleancanJump(int[] nums){//dp[i]表示能否跳到i//dp[j]==true && j+nums[j]>=i j=[0,i-1]int n = nums.length;int right =0;for(int i=0; i<n; i++){//如果i大于right, 那么说明没法走到i, 直接返回false; 必须满足i<=rightif(i>right){returnfalse;}
right = Math.max(right, i+nums[i]);}return right>=n-1;}}
LeetCode Top 100 Liked Questions 55. Jump Game (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 55. Jump Game (Java版; Medium)题目描述Given an array of non-negative integers, you are initially positioned at the first index of the array.Each elem...