Maximum Erasure Value LeetCode solution in Python

1
class Solution:
2
    def maximumUniqueSubarray(self, nums: List[int]) -> int:
3
        low = 0
4
        visited = set()
5
        result = 0
6
        curSum = 0
7
        for high in range(len(nums)):
8
            while nums[high] in visited:
9
                visited.remove(nums[low])
10
                curSum -= nums[low]
11
                low += 1
12

13
            visited.add(nums[high])
14
            curSum += nums[high]
15

16
            if curSum > result:
17
                result = curSum
18

19
        return result