LeetCode 055 - Jump Game - 题解/Solution

https://leetcode.com/problems/jump-game/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
* 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.
*
* For example: A = [2,3,1,1,4], return true.
*
* A = [3,2,1,0,4], return false.
*
* @author dongyuxi
*
*/
public class Solution {
public boolean canJump(int[] nums) {
if (null == nums || 0 == nums.length) {
return false;
}
int maxJump = nums[0];
for (int i = 1; i < nums.length; i++) {
if (maxJump > 0) {
maxJump--;
maxJump = Math.max(maxJump, nums[i]);
} else {
return false;
}
}
return true;
}
}


支付宝 微信
文章目录