zoukankan      html  css  js  c++  java
  • [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 is to reach the last index in the minimum number of jumps.

    For example:
    Given array A = [2,3,1,1,4]

    The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

    解题思路:又是一个极其牛逼的解法,来自leetcode discuss。

    代码:

    class Solution:
        # @param A, a list of integers
        # @return an integer
        # def jump(self, A):
        #     maxint = 1<<31 - 1
        #     dp = [ maxint for i in range(len(A)) ]
        #     dp[0] = 0
        #     for i in range(1, len(A)):
        #         for j in range(i):
        #             if A[j] >= (i - j):
        #                 dp[i] = min(dp[i], dp[j] + 1)
        #     return dp[len(A) - 1]
        # dp is time limited exceeded!
        
    # We use "last" to keep track of the maximum distance that has been reached
    # by using the minimum steps "ret", whereas "curr" is the maximum distance
    # that can be reached by using "ret+1" steps. Thus,curr = max(i+A[i]) where 0 <= i <= last.
        def jump(self, A):    
            ret = 0
            last = 0
            curr = 0
            for i in range(len(A)):
                if i > last:
                    last = curr
                    ret += 1
                curr = max(curr, i+A[i])
            return ret
  • 相关阅读:
    《JavaScript 闯关记》之初探
    《JavaScript 闯关记》之简介
    《JavaScript 闯关记》
    JavaScript检测之basevalidate.js
    如何排版 微信公众号「代码块」
    android开发之路03
    android开发之路02(浅谈BroadcastReceiver)
    android开发之路01
    软件工程复习(一)
    软件工程—人件(一)
  • 原文地址:https://www.cnblogs.com/zuoyuan/p/3781953.html
Copyright © 2011-2022 走看看