LC-2366 Hard LeetCode

2366. Minimum Replacements to Sort the Array

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 53% Topics: Array, Math, Greedy

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min Greedy 11 min

Reference solution (spoiler · python)

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

# greedy, math
class Solution(object):
    def minimumReplacement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        def ceil_divide(a, b):
            return (a+b-1)//b

        result = 0
        curr = nums[-1]
        for x in reversed(nums):
            cnt = ceil_divide(x, curr)
            result += cnt-1
            curr = x//cnt
        return result

Solution from kamyu104/LeetCode-Solutions · MIT