Minimum Replacements to Sort the Array LeetCode solution in Python

1
class Solution:
2
    def minimumReplacement(self, nums) -> int:
3
        ans = 0
4
        n = len(nums)
5
        curr = nums[-1]
6
        for i in range(n - 2, -1, -1):
7
            if nums[i] > curr:
8
                q = nums[i] // curr
9
                if nums[i] == curr * q:
10
                    nums[i] = curr
11
                    ans += q - 1
12
                else:
13
                    nums[i] = nums[i] // (q + 1)
14
                    ans += q
15
            curr = nums[i]
16
        return ans