forked from shichao-an/leetcode-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution.py
More file actions
29 lines (24 loc) · 735 Bytes
/
Copy pathsolution.py
File metadata and controls
29 lines (24 loc) · 735 Bytes
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
"""
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.
"""
class Solution:
# @param A, a list of integers
# @return a boolean
def canJump(self, A):
n = len(A)
if n == 1:
return True
t = 0 # Number of remaining steps
for i in range(1, n):
# t is max number of steps that remained if reaching A[i]
t = max(t, A[i - 1]) - 1
if t < 0:
return False
return True