Package g1601_1700.s1695_maximum_erasure_value

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1695 - Maximum Erasure Value\.

    Medium

    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).

    Example 1:

    Input: nums = 4,2,4,5,6

    Output: 17

    Explanation: The optimal subarray here is 2,4,5,6.

    Example 2:

    Input: nums = 5,2,1,2,5,2,1,2,5

    Output: 8

    Explanation: The optimal subarray here is 5,2,1 or 1,2,5.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maximumUniqueSubarray(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait