[LeetCode] Maximum Erasure Value

1695. Maximum Erasure Value

You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.

Return the maximum score you can get by erasing exactly one subarray.

An array b is called to be a subarray of a if it forms a contiguous subsequence of a, that is, if it is equal to a[l],a[l+1],…,a[r] for some (l,r).

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
int maximumUniqueSubarray(vector<int>& A) {
int res = 0, l = 0, r = 0, n = A.size(), sum = 0;;
unordered_map<int, int> freq;
while(r < n) {
while(r < n and freq[A[r]] == 0) {
freq[A[r]]++;
sum += A[r++];
res = max(res, sum);
}
while(r < n and freq[A[r]] == 1) {
freq[A[l]]--;
sum -= A[l++];
}

}
return res;
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/06/12/PS/LeetCode/maximum-erasure-value/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.