diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_erasure_value.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_erasure_value.cpp')
-rw-r--r-- | other/max_erasure_value.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/max_erasure_value.cpp b/other/max_erasure_value.cpp deleted file mode 100644 index dd72746..0000000 --- a/other/max_erasure_value.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#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); -} |