1658. Minimum Operations to Reduce X to Zero

Posted on Edited on In

1658. Minimum Operations to Reduce X to Zero

Description

Difficulty: Medium

Related Topics: Array, Hash Table, Binary Search, Sliding Window, Prefix Sum

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 is possible, otherwise, return -1.

Example 1:

1
2
3
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:

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

Example 3:

1
2
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

Hints/Notes

  • Sliding window

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
public:
    int minOperations(vector<int>& nums, int x) {
        int sum = 0, size = nums.size();
        for (int num : nums) {
            sum += num;
        }
        int target = sum - x, left = 0, right = 0, res = INT_MAX;
        sum = 0;
        while (right < nums.size()) {
            sum += nums[right];
            if (sum > target) {
                while (sum > target && left <= right) {
                    sum -= nums[left];
                    left++;
                }
            }
            if (sum == target) {
                res = min(res, size - right + left - 1);
            }
            right++; 
        }
        return res == INT_MAX ? -1 : res;
    }
};