[leetcode] 1658. Minimum Operations to Reduce X to Zero

Description

You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x. Note that this modifies the array for future operations.

Return the minimum number of operations to reduce x to exactly 0 if it’s possible, otherwise, return -1.

Example 1:

Input: nums = [1,1,4,2,3], x = 5
Output: 2
Explanation: The optimal solution is to remove the last two elements to reduce x to zero.

Example 2:

Input: nums = [5,6,7,8,9], x = 4
Output: -1

Example 3:

Input: nums = [3,2,20,1,1,3], x = 10
Output: 5
Explanation: The optimal solution is to remove the last three elements and the first two elements (5 operations in total) to reduce x to zero.

Constraints:

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 104
• 1 <= x <= 109

分析

题目的意思是：给你一个数组，给出一个数组nums，和x，问nums的前半部分或者后半部分（包括前半部分+后半部分的情况）是否存在连续数的和为x。

• 这道题的解法有点巧妙，直接求解有点困难，可以计算sum(nums)-x，这样就只需要找出一个子数组的和为sum(nums)-x就行了。
• 前缀数组法，用字典d来存储数组和和对应的下标，找出一个子数组等于s就行了，即nums[i]-s在字典d中。然后维护更新res

res=min(res,n-(i-d[nums[i]-s]))

代码

class Solution:
    def minOperations(self, nums: List[int], x: int) -> int:
        res=float('inf')
        s=sum(nums)-x
        n=len(nums)
        d={0:-1}
        for i in range(n):
            if(i!=0):
                nums[i]=nums[i-1]+nums[i]
            d[nums[i]]=i
            if(nums[i]-s in d):
                res=min(res,n-(i-d[nums[i]-s]))
        if(res=='inf'):
            return -1
        else:
            return res

参考文献

Two python solutions