aboutsummaryrefslogtreecommitdiff
path: root/other/max_erasure_value.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/max_erasure_value.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_erasure_value.cpp')
-rw-r--r--other/max_erasure_value.cpp26
1 files changed, 26 insertions, 0 deletions
diff --git a/other/max_erasure_value.cpp b/other/max_erasure_value.cpp
new file mode 100644
index 0000000..dd72746
--- /dev/null
+++ b/other/max_erasure_value.cpp
@@ -0,0 +1,26 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int maximumUniqueSubarray(vector<int> &nums) {
+ int ans = 0;
+ unordered_set<int> us;
+ for (int i = 0, j = 0, win = 0; j < nums.size(); j++) {
+ while (us.find(nums[j]) != us.end()) {
+ us.erase(nums[i]);
+ win -= nums[i];
+ i++;
+ }
+ us.insert(nums[j]);
+ win += nums[j];
+ ans = max(ans, win);
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums = {5, 2, 1, 2, 5, 2, 1, 2, 5};
+ cout << obj.maximumUniqueSubarray(nums);
+}