ImAlpha/LeetCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

157/170

Browse Source
This commit is contained in:
Jacob Delgado 2023-07-01 22:01:46 -07:00
parent 262543afc5
commit cb07bc053b
1 changed files with 16 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
Top150Interview/55JumpGame.py
View File

@ -4,31 +4,27 @@ def canJump(nums):
:rtype: bool :rtype: bool
""" """
# Each index value is the maximum you can jump from that position # Each index value is the maximum you can jump from that position
# count = 1
# for x in nums:
# if x >= len(nums)-1:
# return True
# jump = nums[count]
# if x >= jump:
# if jump >= len(nums)-1:
# return True
maxJump = 0 maxJump = 0
for x in range(len(nums)-1): for x in range(len(nums)-1):
maxJump += nums[x] maxJump += nums[x]
print(maxJump) if nums[x] >= len(nums)-(x+1):
return True
# print(maxJump)
if nums[x] == 0: if nums[x] == 0:
print(x+1)
print(len(nums))
if nums[x+1] >= len(nums)-x:
return True
return False return False
if maxJump >= len(nums)-1: return True
return True # if maxJump >= len(nums)-1:
else:
return False
# jump = nums[1]
# if jump >= len(nums)-1:
# print('Can make the jump')
# return True # return True
# else: # else:
# return False # return False
print(canJump([2,3,1,1,4]))
print(canJump([3,2,1,0,4])) # print(canJump([2,3,1,1,4]))
print(canJump([3,2,1,0,4]))
# print(canJump([3,0,8,2,0,0,1]))
# print(canJump([2,0,2]))
# print(canJump([2,0,0]))
# print(canJump([1,1,2,2,0,1,1]))