逆向思维+双指针
class Solution {
public:
int minOperations(vector<int>& nums, int x) {
int len = nums.size(), total = 0; // total 记录符合条件的最大和
int sum = accumulate(nums.begin(), nums.end(), 0) - x;
if (sum < 0) return -1; // 数组和小于x无结果
int left = 0, res = -1;
for (int right = 0; right < len; right ++ ) {
total += nums[right]; // right 向右更新
while (total > sum) total -= nums[left++]; // left 减去首部的值
if (total == sum) res = max(res, right - left + 1); // 找出最长子串
}
return res < 0 ? -1 : len - res; // 没有子串则返回-1
}
};