-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathJumpGame.kt
39 lines (33 loc) · 827 Bytes
/
JumpGame.kt
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
34
35
36
37
38
39
/**
* 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.
*
* Accepted.
*/
class JumpGame {
fun canJump(nums: IntArray): Boolean {
if (nums.isEmpty()) {
return false
}
if (nums.size == 1) {
return true
}
var maxLength = 0
for (i in 0 until nums.size - 1) {
maxLength--
maxLength = Math.max(maxLength, nums[i])
if (maxLength == 0) {
return false
}
}
return maxLength > 0
}
}