mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
0055 跳跃游戏添加python 解法
This commit is contained in:
@ -143,6 +143,23 @@ class Solution:
|
|||||||
return False
|
return False
|
||||||
```
|
```
|
||||||
|
|
||||||
|
```python
|
||||||
|
## 基于当前最远可到达位置判断
|
||||||
|
class Solution:
|
||||||
|
def canJump(self, nums: List[int]) -> bool:
|
||||||
|
far = nums[0]
|
||||||
|
for i in range(len(nums)):
|
||||||
|
# 要考虑两个情况
|
||||||
|
# 1. i <= far - 表示 当前位置i 可以到达
|
||||||
|
# 2. i > far - 表示 当前位置i 无法到达
|
||||||
|
if i > far:
|
||||||
|
return False
|
||||||
|
far = max(far, nums[i]+i)
|
||||||
|
# 如果循环正常结束,表示最后一个位置也可以到达,否则会在中途直接退出
|
||||||
|
# 关键点在于,要想明白其实列表中的每个位置都是需要验证能否到达的
|
||||||
|
return True
|
||||||
|
```
|
||||||
|
|
||||||
### Go
|
### Go
|
||||||
|
|
||||||
```go
|
```go
|
||||||
|
Reference in New Issue
Block a user