[LeetCode]题解（python）：045-Jump game II

题目来源

https://leetcode.com/problems/jump-game-ii/

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

题意分析

Input: a list named nums

Output:minimum steps to the last index

Conditions:最小的步数到达最后

题目思路

网上大牛的代码好厉害= =想了老半天才想懂，主要思想是每一次跳跃时记录一个能到达的最大位置，然后在这个位置前记录所能到达的位置的最大位置（不断更新），当到达之前步数记录最大位置时，step+1，然后赋值新的最大位置，然后继续遍历下去（感觉这样说我都不明白……直接看代码）

AC代码（Python）

 1 class Solution(object):
 2     def jump(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: int
 6         """
 7         last = 0
 8
 9         #the number steps
10         step = 0
11
12         #current  max
13         curr = 0
14
15         for i in range(len(nums)):
16             if i > last:
17                 step += 1
18                 last = curr
19             curr = max(curr, i + nums[i])
20
21         return step

时间： 2024-10-13 11:31:21

[LeetCode]题解（python）：045-Jump game II的相关文章

LeetCode 045 Jump Game II

题目要求:Jump Game II Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minim

045. Jump Game II

方法一:遍历所有可能的情况,复杂度O(N^2),超时 1 class Solution { 2 public: 3 int jump(vector<int>& nums) { 4 if (nums.size() < 2) return 0; 5 else { 6 vector<int> max_jump(nums.size(), static_cast<int>(nums.size())); 7 vector<int> reach(nums.s

[LeetCode] Leetcode 题解索引 (C++/Java/Python/Sql)

全部最新的题解可以在我的 github 上找,欢迎 star 和 watch ~ 更新中~~ 说明这个系列的题解包括用 C++/Java/Python 写的 leetcode 上的算法题目,和 Sql 写的 leetcode 上的数据库题目. 有些题目虽然 AC 了却还没写分析,所以这次就开坑来完成. 链接: 我的 github Leetcode Algorithms Problems Leetcode Database Problems CSDN 题解索引 001.Two_Sum (Med

[leetcode]Jump Game II @ Python

原题地址:https://oj.leetcode.com/problems/jump-game-ii/ 题意: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal i

Jump Game II leetcode java

题目: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of j

【leetcode刷题笔记】Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps

[LeetCode]题解（python）：031-Next Permutation

题目来源 https://leetcode.com/problems/next-permutation/ Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible

leetcode 题解：Search in Rotated Sorted Array II （旋转已排序数组查找2）

题目: Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed? Would this affect the run-time complexity? How and why? Write a function to determine if a given target is in the array. 说明: 1)和1比只是有重复的数字,整体仍采用二分查找 2)方法二 : 实现:

[LeetCode] Jump Game II(贪婪算法)

[leetcode]Remove Duplicates from Sorted List II @ Python

原题地址:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ 题意: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2->3->3->4-&g