1695. Maximum Erasure Value

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
public:
    int maximumUniqueSubarray(vector<int>& nums) {
        // slide window
        int ret = 0;
        unordered_map<int,int> window, need;
        int l = 0, r = 0,n = nums.size(), len = 0, window_total =  0;
        while(r<n){
            int c = nums[r++];
            if(window[c]==0) len++;
            window[c]++;
            
            window_total+=c;
            while(window[c]>1){
                int d = nums[l++];
                window[d]--;
                if(window[d] == 0) len--;
                window_total-=d;
            }
            ret = max(ret, window_total);
        }
        return ret;
    }
};

analysis

  • time complexity O(n)
  • space complexity O(n)