aboutsummaryrefslogtreecommitdiff
path: root/other/min_operations_x_zero.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/min_operations_x_zero.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_operations_x_zero.cpp')
-rw-r--r--other/min_operations_x_zero.cpp27
1 files changed, 27 insertions, 0 deletions
diff --git a/other/min_operations_x_zero.cpp b/other/min_operations_x_zero.cpp
new file mode 100644
index 0000000..011839e
--- /dev/null
+++ b/other/min_operations_x_zero.cpp
@@ -0,0 +1,27 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int minOperations(vector<int> &nums, int x) {
+ unordered_map<int, int> left;
+ int ans = INT_MAX;
+ for (auto i = 0, sum = 0; i < nums.size() && sum <= x; ++i) {
+ left[sum] = i;
+ sum += nums[i];
+ }
+ for (int i = nums.size() - 1, sum = 0; i >= 0 && sum <= x; --i) {
+ auto it = left.find(x - sum);
+ if (it != end(left) && i + 1 >= it->second)
+ ans = min(ans, nums.size() - i - 1 + it->second);
+ sum += nums[i];
+ }
+ return ans = INT_MAX ? -1 : ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums = {1, 1, 4, 2, 3};
+ int x = 5;
+ cout << obj.minOperations(nums, x);
+}