55. Jump Game——python——greedy
題目分析：每次記錄到達的最遠位置，只是當前情況下的最優解。屬於貪心算法。 class Solution(object):
def repeatedNTimes(self, nums):
# 貪心算法
reach = 0
for i, num in enumerate(nums):
if i > reach:
相關文章
- 1. (Greedy) leetcode 55. 45. Jump Game I II
- 2. LeetCode 55. Jump Game
- 3. Leetcode 55. jump game
- 4. 55 Jump Game
- 5. LeetCode 55 jump game
- 6. 55-Jump Game
- 7. LeetCode 55. Jump Game & 45. Jump Game II題解
- 8. [LeetCode] 55. Jump Game & 45. Jump Game II
- 9. [LeetCode] 55. Jump Game Java
- 10. leetcode [Greedy] No.45 Jump Game II
- 更多相關文章...
- • SQLite - Python - SQLite教程
- • Docker 安裝 Python - Docker教程
- • YAML 入門教程
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. (Greedy) leetcode 55. 45. Jump Game I II
- 2. LeetCode 55. Jump Game
- 3. Leetcode 55. jump game
- 4. 55 Jump Game
- 5. LeetCode 55 jump game
- 6. 55-Jump Game
- 7. LeetCode 55. Jump Game & 45. Jump Game II題解
- 8. [LeetCode] 55. Jump Game & 45. Jump Game II
- 9. [LeetCode] 55. Jump Game Java
- 10. leetcode [Greedy] No.45 Jump Game II