Commit 33fa586

committed

Jump Game

1 parent f6232c0 commit 33fa586Copy full SHA for 33fa586

File tree

+14

-4

lines changed

+14

-4

lines changed

Lines changed: 14 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,12 +16,22 @@`
`16`	`16`	`Explanation: You will always arrive at index 3 no matter what. Its maximum`
`17`	`17`	`jump length is 0, which makes it impossible to reach the last index.`
`18`	`18`	`"""`
`19`		`-class Solution3:`
`20`		`- # Time Complexity: O(n)`
`21`		`- # Space Complexity: O(1)`
	`19`	`+class Solution:`
	`20`	`+ def canJump(self, nums: List[int]) -> bool:`
	`21`	`+ max_reach = nums[0]`
	`22`	`+`
	`23`	`+ for index in range(1, len(nums)):`
	`24`	`+ if index > max_reach:`
	`25`	`+ break`
	`26`	`+ max_reach = max(max_reach, index + nums[index])`
	`27`	`+`
	`28`	`+ return max_reach >= len(nums) - 1`
	`29`	`+`
	`30`	`+`
	`31`	`+class Solution1:`
`22`	`32`	`def canJump(self, nums: List[int]) -> bool:`
`23`	`33`	`lastPos = len(nums) - 1`
`24`	`34`	`for i in range(len(nums)-1, -1, -1):`
`25`	`35`	`if i + nums[i] >= lastPos:`
`26`	`36`	`lastPos = i`
`27`		`- return lastPos == 0`
	`37`	`+ return lastPos == 0`

Comments

(0)