[LeetCode] 1354. Construct Target Array With Multiple Sums

import heapq

class Solution:
    def isPossible(self, target: List[int]) -> bool:
        heapq._heapify_max(target)
        s = sum(target)
        
        while (target[0] != 1):
            sub = s- target[0]
            if (sub >= target[0] or sub == 0):
                return False
            iterNum = max( ((target[0]-1) // sub),1)
            
            temp = target[0] - (sub * iterNum)
            
            if (temp < 1):
                return False
            v = heapq._heapreplace_max(target, temp)
            s = sum(target)
            
        return True