Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create JumpGame.py #2499

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Create JumpGame.py #2499

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions Leetcode/Python/JumpGame.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
"""
Greedy Algorithm
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
"""

class Solution:
def canJump(self, nums: List[int]) -> bool:
leftind = n = len(nums) - 1
for i in range(n,-1,-1):
if (i + nums[i]) >= leftind:
leftind = i
return leftind == 0
obj = Solution()
nums = list(map(int,input().split()))
print(obj.canJump(nums))