Minimum Operations to Reduce X to Zero LeetCode solution in Python

1
class Solution:
2
    def minOperations(self, nums: List[int], x: int) -> int:
3
        target, n = sum(nums) - x, len(nums)
4

5
        if target == 0:
6
            return n
7

8
        max_len = cur_sum = left = 0
9

10
        for right, val in enumerate(nums):
11
            cur_sum += val
12
            while left <= right and cur_sum > target:
13
                cur_sum -= nums[left]
14
                left += 1
15
            if cur_sum == target:
16
                max_len = max(max_len, right - left + 1)
17

18
        return n - max_len if max_len else -1