LeetCode 筆記 - 1658. Minimum Operations to Reduce X to Zero

class Solution:
    def minOperations(self, nums: List[int], x: int) -> int:
        
        if (total := sum(nums)) < x:
            return -1

        size = len(nums)
        
        if total == x:
            return size
        
        count = collections.defaultdict(int)
        temp = 0
        for i in range(size):
            temp += nums[i]
            count[i] = temp

        target = total - x
        start = 0
        
        result = size
        for end in range(size):
            
            while True:
                value = count[end] - count[start - 1]
                
                if value == target:
                    result = min(result, start + (size - end - 1))
                    break
                elif value < target:
                    break
                start += 1
                if start > end:
                    break
        
        if result == size:
            return -1
        return result