LC-0045 Medium LeetCode

45. Jump Game II

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 41% Topics: Array, Dynamic Programming, Greedy

Reading material

Arrays & Hashing 12 min 1-D Dynamic Programming 16 min Greedy 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    # @param A, a list of integers
    # @return an integer
    def jump(self, A):
        jump_count = 0
        reachable = 0
        curr_reachable = 0
        for i, length in enumerate(A):
            if i > reachable:
                return -1
            if i > curr_reachable:
                curr_reachable = reachable
                jump_count += 1
            reachable = max(reachable, i + length)
        return jump_count

Solution from kamyu104/LeetCode-Solutions · MIT